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 12, 2026 00:29Victor MerckléVictor MerckléScore: 64,591Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 00:3064,43532,780,60022,814,0001,027,0002,113,536
2May 12, 2026 00:3064,54332,641,55422,860,0001,021,0002,113,536
3May 12, 2026 00:3064,55432,945,05722,863,0001,022,0002,113,536
4May 12, 2026 00:3064,56733,892,53322,859,0001,031,0002,113,536
5May 12, 2026 00:3064,59134,486,08122,815,0001,084,0002,113,536
6May 12, 2026 00:3064,81632,704,01822,973,0001,009,0002,113,536
7May 12, 2026 00:3065,51333,107,87323,112,0001,128,0002,113,536
8May 12, 2026 00:3065,67545,389,06123,155,0001,145,0002,113,536
9May 12, 2026 00:3072,01349,740,14725,503,0001,142,0002,117,632