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 listMar 22, 2026 21:16olliecrowolliecrowScore: 143,062Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 16:02142,75775,128,70350,827,0001,993,0002,486,272
2Mar 22, 2026 21:16143,04673,177,25850,930,0001,997,0002,486,272
3Mar 21, 2026 16:02143,05776,327,52950,934,0001,997,0002,469,888
4Mar 22, 2026 21:16143,06279,365,28450,936,0001,997,0002,469,888
5Mar 22, 2026 21:16143,41975,048,55551,063,0002,002,0002,527,232
6Mar 21, 2026 16:02145,75488,571,73251,932,0001,997,0002,478,080