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 listAug 16, 2025 14:29Aniruddha DebAniruddha DebScore: 67,646Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2025 14:2967,35445,249,14523,925,000996,0002,531,328
2Aug 16, 2025 14:2967,64652,856,36024,028,0001,001,0002,531,328
3Aug 16, 2025 14:2967,74351,551,62024,063,0001,002,0002,531,328