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 listAug 16, 2025 15:05Aniruddha DebAniruddha DebScore: 68,603Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2025 15:0568,40045,835,31925,308,00002,531,328
2Aug 16, 2025 15:0568,60345,884,82825,383,00002,531,328
3Aug 16, 2025 15:0568,98647,996,11625,525,00002,531,328