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 20, 2026 17:03olliecrowolliecrowScore: 102,311Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 17:03101,37359,297,34935,481,0002,027,0002,449,408
2Mar 20, 2026 17:03102,31163,967,64735,863,0001,992,0002,342,912
3Mar 20, 2026 17:03105,68161,580,12036,095,0003,007,0002,342,912