The achromatic index of a graph \(G\) is the largest integer \(k\) admitting a proper colouring of edges of \(G\) in such a way that each pair of colours appears on some pair of adjacent edges. It is shown that the achromatic index of \(K_{12}\) is \(32\).