← Back to leaderboard

Per problem leaderboard

One mini leaderboard per challenge problem. Pick any card to see who has solved that problem and how fast their proof elaborates. Ranking inside each problem is by proof heartbeats ascending, then proof bytes (comments stripped) ascending, then submission time ascending. Verifier: SafeVerify. Last updated 2026-06-22 16:42.

Phase 1

Binary Heap and Dijkstra

Minimum Spanning Tree

Segment Tree

Treap analysis (probabilistic)

Treap algorithms

Phase 2

Splay Tree

Spanner