Sorting Strings

Count the 26 letter frequencies and sort by the tuple (score, length, string). The score is at most $20^2=400$, and the total input length is at most $10^6$. Time is $O(20N\log N)$. Selection sort suffices for the small subtask.