List ranking is considered for linear and circular arrays with P processing units. It was known that this problem can be solved with O(P) communication steps. In this paper we show that the optimal number of communication steps, P - 1 and P/2, respectively, can be achieved.