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:44Aniruddha DebAniruddha DebScore: 69,146Success
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:4468,91146,655,09924,478,0001,019,0002,519,040
2Aug 16, 2025 14:4469,14650,767,38725,584,00002,408,448
3Aug 16, 2025 14:4469,40349,365,37525,679,00002,519,040