Comparison-based lower-bound for finding duplicates in an array of $n$ numbers
Your problem is known as element distinctness. You can find $\Omega(n \log n)$ lower bounds for several computation models in the answers to a question on cstheory. The lower bound for the comparison model is particularly simple.