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,746Success
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,71449,000,20425,158,0001,006,0002,428,928
2Mar 15, 2025 12:2070,74650,050,21725,170,0001,006,0002,531,328
3Mar 15, 2025 12:2071,24651,988,08225,348,0001,013,0002,269,184