5 ms·

Sure it does: https://gist.github.com/brettcannon/82c4fe68bac30f4ed653#file-gistfile1-py-L11 https://gist.github.com/brettcannon/82c4fe68bac30f4ed653#fil...

• moe 12y ago
  Sorry, you are right, I missed that. Arguably your solution is still different because you sort the input instead of the output, but that's unlikely to matter here.
  • eridius 12y ago
    The only difference is I sort before uniquing, but the python code uniques before sorting. But the result is identical (and in shell scripting, you can't unique without sorting first). Although FWIW I just checked and the `sort` tool actually has a flag for uniquing during the sort. I don't know if that's portable though.
    • moe 12y ago
      Yes. Pedantically speaking his solution may be faster for the pathological case of the input consisting almost entirely of duplicates.