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 17, 2025 23:32Aniruddha DebAniruddha DebScore: 69,919Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2025 23:3269,86554,322,31224,856,000994,0002,416,640
2Mar 17, 2025 23:3269,91953,356,78723,880,0001,990,0002,531,328
3Mar 17, 2025 23:3270,19248,297,46024,973,000998,0002,531,328