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 21, 2026 18:52M-RochatM-RochatScore: 59,591Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 18:5459,43232,955,23520,920,0001,070,0002,113,536
2May 21, 2026 18:5459,48131,262,34220,869,0001,139,0002,113,536
3May 21, 2026 18:5459,49133,357,72020,873,0001,139,0002,113,536
4May 21, 2026 18:5459,59133,110,10120,971,0001,078,0002,113,536
5May 21, 2026 18:5459,59132,092,82620,911,0001,138,0002,117,632
6May 21, 2026 18:5459,60834,508,51520,911,0001,144,0002,113,536
7May 21, 2026 18:5459,66733,211,94921,020,0001,057,0002,113,536
8May 21, 2026 18:5459,67234,391,21521,005,0001,074,0002,113,536
9May 21, 2026 18:5459,78132,780,59220,959,0001,160,0002,113,536