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 13, 2025 23:40Aniruddha DebAniruddha DebScore: 167,265Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2025 23:40167,12792,568,42560,840,000997,0002,269,184
2Mar 13, 2025 23:40167,26584,179,53560,874,0001,014,0002,428,928
3Mar 13, 2025 23:40167,27088,439,16860,892,000998,0002,531,328