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 listSep 19, 2026 13:23Andrew EpsteinAndrew EpsteinScore: 3,536,381Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 13:263,531,3861,316,932,5691,304,482,0002,131,0002,125,824stderr
2Sep 19, 2026 13:263,531,6051,317,058,5991,304,428,0002,266,0002,125,824stderr
3Sep 19, 2026 13:263,532,5971,317,483,9701,304,790,0002,271,0002,125,824stderr
4Sep 19, 2026 13:263,534,1101,317,898,3291,305,349,0002,272,0002,125,824stderr
5Sep 19, 2026 13:263,536,3811,318,595,7581,306,400,0002,061,0002,125,824stderr
6Sep 19, 2026 13:263,537,6271,319,107,3461,306,715,0002,207,0002,125,824stderr
7Sep 19, 2026 13:263,549,6971,326,285,5081,311,380,0002,008,0002,125,824stderr
8Sep 19, 2026 13:263,553,3101,324,995,4091,312,577,0002,148,0002,125,824stderr
9Sep 19, 2026 13:263,559,8621,328,197,3901,315,085,0002,064,0002,125,824stderr