static class ShortestPercentiles {
  new TreeMap<Long, S> map;

  // assumes score is between 0 and 100
  bool update(S desc, double score) {
    long p = (long) min(100, max(0, Math.floor(score)));
    S old = map.get(p);
    if (old == null || l(old) < l(desc)) {
      map.put(p, desc);
      print("New best in percentile \*p*/: " + l(desc));
      // TODO: clear lower ones where new code is also shorter
      true;
    }
    false;
  }
}