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 13:14IlyaIlyaScore: 59,178Success
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 13:1558,83231,429,99220,650,0001,118,0002,113,536
2Jul 7, 2026 13:1558,97831,443,43520,668,0001,154,0002,113,536
3Jul 7, 2026 13:1559,07031,519,29220,646,0001,210,0002,113,536
4Jul 7, 2026 13:1559,10031,519,59620,675,0001,192,0002,113,536
5Jul 7, 2026 13:1559,17831,610,78520,729,0001,167,0002,113,536
6Jul 7, 2026 13:1559,18633,513,78720,700,0001,199,0002,113,536
7Jul 7, 2026 13:1559,28332,123,60820,721,0001,214,0002,113,536
8Jul 7, 2026 13:1559,42132,160,99420,758,0001,228,0002,113,536
9Jul 7, 2026 13:1559,47232,206,55120,800,0001,205,0002,113,536