HFT University
Benchmark. Compete. Prove.
Challenge 01 is now free! Try the Order Book challenge in C++ or Rust — no subscription required. Set up your repo, submit your solution, and see how you rank. Start now
| Rank | Name | Best Score |
|---|---|---|
| Baseline (reference solution) | 731 cycles/op |