Fast Squarier Transform (Editorial)

Note that there can be at most $6326$ different numbers among $a_i$. Indeed, if there are at least $6327$ distinct elements there, their sum is at least $0+1+\dots +6326=20005975>20000000$.

So, for every element $x$ of $a$ count $cnt[x]$ —