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 listJun 30, 2026 18:03IlyaIlyaScore: 58,989Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 18:0458,80832,853,45820,628,0001,131,0002,113,536
2Jun 30, 2026 18:0458,81631,208,41320,658,0001,104,0002,113,536
3Jun 30, 2026 18:0458,90531,403,30820,686,0001,109,0002,113,536
4Jun 30, 2026 18:0458,97031,299,07320,707,0001,112,0002,113,536
5Jun 30, 2026 18:0458,98931,366,37520,628,0001,198,0002,113,536
6Jun 30, 2026 18:0458,98931,384,88120,652,0001,174,0002,113,536
7Jun 30, 2026 18:0459,05431,870,44520,649,0001,201,0002,113,536
8Jun 30, 2026 18:0459,19431,440,86620,709,0001,193,0002,113,536
9Jun 30, 2026 18:0459,29431,910,14920,723,0001,216,0002,113,536