TopK Sergey Svistunov

Find the sum of the 100 largest values in a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listJul 3, 2026 07:45IlyaIlyaScore: 59,064Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 07:4858,84531,750,63820,654,0001,119,0002,113,536
2Jul 3, 2026 07:4858,86431,310,18220,633,0001,147,0002,113,536
3Jul 3, 2026 07:4858,93231,560,48120,703,0001,102,0002,113,536
4Jul 3, 2026 07:4858,93531,265,34420,679,0001,127,0002,113,536
5Jul 3, 2026 07:4859,06431,410,32520,751,0001,103,0002,113,536
6Jul 3, 2026 07:4859,13231,389,21420,637,0001,242,0002,113,536
7Jul 3, 2026 07:4859,15131,930,00420,694,0001,192,0002,113,536
8Jul 3, 2026 07:4859,18631,451,96520,700,0001,199,0002,113,536
9Jul 3, 2026 07:4859,38931,524,92720,743,0001,231,0002,113,536