Why is the lower bound of element uniqueness in $\Omega(n\log n)$?
We assume the comparison model in the lower bound of the element uniqueness problem. That is, the key operations are to compare elements. In particular, hashing is not allowed.