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 26, 2025 18:44Aniruddha DebAniruddha DebScore: 71,900Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2025 18:4471,70553,969,86426,531,00002,392,064
2Mar 26, 2025 18:4471,90052,263,19925,580,0001,023,0002,531,328
3Mar 26, 2025 18:4472,58948,617,02226,858,00002,269,184