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 17, 2026 03:05M-RochatM-RochatScore: 67,029Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 03:0766,81034,376,83123,688,0001,032,0002,113,536
2May 17, 2026 03:0766,86433,311,88923,725,0001,015,0002,113,536
3May 17, 2026 03:0767,02435,664,26223,762,0001,037,0002,113,536
4May 17, 2026 03:0767,02433,672,95923,750,0001,049,0002,113,536
5May 17, 2026 03:0767,02935,065,43523,777,0001,024,0002,113,536
6May 17, 2026 03:0767,22434,622,18623,854,0001,019,0002,113,536
7May 17, 2026 03:0767,33535,599,04023,880,0001,034,0002,113,536
8May 17, 2026 03:0767,52435,452,54923,960,0001,024,0002,113,536
9May 17, 2026 03:0767,63735,874,30923,965,0001,061,0002,113,536