only sort when necessary and faster hash
only sort when necessary and faster hash

* sort is much more expensive than count, so we only sort if we have something to sort
* could implement for ksort too, but advantage there is minimal since we almost always have more than 1 possibility
* use same hash algorithm as in other places (= faster)
* reduces runtime by 2-3%

vimeo/psalm,vimeo/psalm