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 15, 2025 12:20Aniruddha DebAniruddha DebScore: 70,365Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2025 12:2070,24945,488,49724,993,000999,0002,531,328
2Mar 15, 2025 12:2070,36546,465,36025,034,0001,001,0002,428,928
3Mar 15, 2025 12:2071,65447,238,52926,512,00002,420,736