in reply to Re^2: a more efficient lexicographical sort?
in thread a more efficient lexicographical sort?

I think that you can make it even faster and less memory hungry encoding the oid numbers as unicode chars:
@sorted = keysort { pack "U*" => split /\./, $_ } @oids;