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:42Aniruddha DebAniruddha DebScore: 68,530Success
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:4268,43547,926,84925,321,00002,531,328
2Aug 16, 2025 14:4268,53048,551,43624,342,0001,014,0002,531,328
3Aug 16, 2025 14:4268,96242,276,50525,516,00002,531,328