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 20:11Victor MerckléVictor MerckléError
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 20:11034,942,74423,061,0001,100,0002,113,536expected "429496509337 ", got "429496462256 "
2May 11, 2026 20:11034,788,05523,215,0001,006,0002,113,536expected "429496499458 ", got "429496416918 "
3May 11, 2026 20:11034,894,80823,111,0001,085,0002,113,536expected "429496465059 ", got "429496396054 "