Abstract. It is known that among 2-connected graphs on n vertices the maximum Wiener index is attained by the cycle C_n. We show that the second maximum graph is obtained from C_3 by connecting two its vertices by a path, and the third maximum graph is obtained from C_4 by connecting two oposite vertices by a path. We also describe the situation for small values of n.