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:20IlyaIlyaScore: 59,224Success
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:2158,77031,336,44420,626,0001,119,0002,113,536
2Jul 7, 2026 13:2158,91631,443,31720,689,0001,110,0002,113,536
3Jul 7, 2026 13:2159,06431,470,86920,737,0001,117,0002,113,536
4Jul 7, 2026 13:2159,20231,553,84120,876,0001,029,0002,113,536
5Jul 7, 2026 13:2159,22431,645,29920,717,0001,196,0002,113,536
6Jul 7, 2026 13:2159,26231,753,19020,723,0001,204,0002,113,536
7Jul 7, 2026 13:2159,27832,121,57820,730,0001,203,0002,113,536
8Jul 7, 2026 13:2159,28131,462,49920,740,0001,194,0002,113,536
9Jul 7, 2026 13:2159,34331,484,34220,749,0001,208,0002,113,536