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 17:38Aniruddha DebAniruddha DebScore: 69,841Success
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 17:3869,18649,773,24925,599,00002,269,184
2Mar 26, 2025 17:3869,84156,202,88124,848,000993,0002,527,232
3Mar 26, 2025 17:3869,95947,032,22624,850,0001,035,0002,404,352