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 listMay 18, 2026 18:35M-RochatM-RochatScore: 59,586Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 18:3759,36431,163,46020,891,0001,074,0002,113,536
2May 18, 2026 18:3759,44331,640,02520,911,0001,083,0002,113,536
3May 18, 2026 18:3759,49432,127,34120,846,0001,167,0002,113,536
4May 18, 2026 18:3759,58133,241,88620,891,0001,154,0002,113,536
5May 18, 2026 18:3759,58633,543,69720,872,0001,175,0002,113,536
6May 18, 2026 18:3759,58931,242,89720,902,0001,146,0002,113,536
7May 18, 2026 18:3759,60831,721,52320,990,0001,065,0002,113,536
8May 18, 2026 18:3759,81032,758,06320,959,0001,171,0002,113,536
9May 18, 2026 18:3759,82134,409,23420,962,0001,172,0002,113,536