@array = (shift @sorted)

(the parentheses are to make it an array assignment).

If there are many duplicates it might be more efficient to first remove the duplicates before sorting. But there is no transforming the array into a hash and back.

I can't tell which is more efficient. My intention was to show a different approach. It shows again that there are many ways to do similar things.