If you have arranged for the incoming data to be provided in your preferred order, you can retain that order in the HASH by using Tie::IxHash.

This avoids the entire sort process. I don't know if this is more efficient than the sort process on this size list.