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 23:55Victor MerckléVictor MerckléScore: 64,721Success
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 23:5764,54832,641,20822,782,0001,101,0002,113,536
2May 11, 2026 23:5764,61334,798,56722,814,0001,093,0002,113,536
3May 11, 2026 23:5764,67034,291,55122,842,0001,086,0002,113,536
4May 11, 2026 23:5764,68934,535,49122,835,0001,100,0002,113,536
5May 11, 2026 23:5764,72132,692,88222,839,0001,108,0002,113,536
6May 11, 2026 23:5764,96234,528,82422,950,0001,086,0002,113,536
7May 11, 2026 23:5765,01635,195,66722,978,0001,078,0002,113,536
8May 11, 2026 23:5765,02934,088,56422,977,0001,084,0002,113,536
9May 11, 2026 23:5765,40832,955,53523,150,0001,051,0002,113,536