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 11, 2026 16:50Victor MerckléVictor MerckléScore: 66,640Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 16:5166,53536,190,48723,603,0001,015,0002,113,536
2May 11, 2026 16:5166,57035,067,24323,455,0001,176,0002,113,536
3May 11, 2026 16:5166,60535,278,53423,457,0001,187,0002,113,536
4May 11, 2026 16:5166,62134,399,34723,615,0001,035,0002,113,536
5May 11, 2026 16:5166,64036,443,87623,636,0001,021,0002,113,536
6May 11, 2026 16:5166,73533,426,80423,491,0001,201,0002,113,536
7May 11, 2026 16:5167,01635,400,26223,777,0001,019,0002,113,536
8May 11, 2026 16:5167,02135,392,74123,788,0001,010,0002,113,536
9May 11, 2026 16:5167,04836,012,39723,620,0001,188,0002,113,536