in reply to Re^2: Get hash value with the lowest key
in thread Get hash value with the lowest key

You read the benchmark numbers falsely. Higher rate means faster.

BTW List::Util::min seems to be always the fastest.

  • Comment on Re^3: Get hash value with the lowest key