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 5, 2026 03:23olliecrowolliecrowScore: 60,151Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 03:2459,87040,241,46520,969,0001,183,0002,375,680
2May 5, 2026 03:2459,98642,579,13921,135,0001,060,0002,396,160
3May 5, 2026 03:2460,04540,924,72321,031,0001,186,0002,379,776
4May 5, 2026 03:2460,06238,952,78021,036,0001,187,0002,379,776
5May 5, 2026 03:2460,15141,831,94421,145,0001,111,0002,383,872
6May 5, 2026 03:2460,32439,328,94521,219,0001,101,0002,371,584
7May 5, 2026 03:2460,33737,827,46321,129,0001,196,0002,392,064
8May 5, 2026 03:2460,46240,767,19821,245,0001,126,0002,375,680
9May 5, 2026 03:2460,48940,579,58121,244,0001,137,0002,322,432