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 listApr 26, 2026 19:32TudyMTudyMScore: 124,764Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 19:33124,11361,438,38843,926,0001,996,0002,375,680
2Apr 26, 2026 19:33124,24566,630,83243,973,0001,998,0002,371,584
3Apr 26, 2026 19:33124,24861,616,41543,974,0001,998,0002,371,584
4Apr 26, 2026 19:33124,47266,825,76945,054,0001,001,0002,363,392
5Apr 26, 2026 19:33124,76464,387,73744,156,0002,007,0002,367,488
6Apr 26, 2026 19:33124,99462,920,47343,232,0003,016,0002,555,904
7Apr 26, 2026 19:33125,01363,569,98544,244,0002,011,0002,371,584
8Apr 26, 2026 19:33125,01661,358,24745,251,0001,005,0002,441,216
9Apr 26, 2026 19:33125,15964,864,64045,303,0001,006,0002,367,488