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 7, 2026 12:25IlyaIlyaScore: 60,613Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 12:2660,20531,943,58421,160,0001,116,0002,113,536
2Jul 7, 2026 12:2660,23731,856,84321,143,0001,145,0002,113,536
3Jul 7, 2026 12:2660,23733,195,93421,155,0001,133,0002,113,536
4Jul 7, 2026 12:2660,47231,983,34521,272,0001,103,0002,113,536
5Jul 7, 2026 12:2660,61332,173,69721,275,0001,152,0002,113,536
6Jul 7, 2026 12:2660,78632,417,65921,283,0001,208,0002,113,536
7Jul 7, 2026 12:2660,79432,107,23221,276,0001,218,0002,113,536
8Jul 7, 2026 12:2660,82132,134,74821,302,0001,202,0002,113,536
9Jul 7, 2026 12:2660,94332,206,18621,303,0001,246,0002,113,536