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 listMay 11, 2026 23:40Victor MerckléVictor MerckléScore: 69,378Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 23:4168,98134,720,18224,428,0001,095,0002,113,536
2May 11, 2026 23:4169,02734,356,89024,536,0001,004,0002,113,536
3May 11, 2026 23:4169,11635,212,64624,554,0001,019,0002,113,536
4May 11, 2026 23:4169,33537,361,32124,540,0001,114,0002,113,536
5May 11, 2026 23:4169,37834,461,22924,575,0001,095,0002,113,536
6May 11, 2026 23:4169,37835,917,58624,586,0001,084,0002,113,536
7May 11, 2026 23:4169,40534,786,61524,582,0001,098,0002,113,536
8May 11, 2026 23:4169,45134,479,81024,598,0001,099,0002,113,536
9May 11, 2026 23:4169,69734,899,97424,678,0001,110,0002,113,536