We prove that for any $k \ge 3$, every $k$-uniform hypergraph on $n$ vertices contains at most $n - ω(1)$ different sizes of cliques (maximal complete subgraphs). In particular, the 3-uniform case answers a question of Erdős.