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 17, 2025 23:34Aniruddha DebAniruddha DebScore: 71,708Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2025 23:3470,80851,510,12325,192,0001,007,0002,531,328
2Mar 17, 2025 23:3471,70852,415,06625,512,0001,020,0002,531,328
3Mar 17, 2025 23:3472,67056,402,22726,888,00002,531,328