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 22:14Victor MerckléVictor MerckléScore: 64,597Success
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 22:1564,27533,301,66322,739,0001,043,0002,113,536
2May 11, 2026 22:1564,32932,841,56722,781,0001,021,0002,113,536
3May 11, 2026 22:1564,42734,497,88722,830,0001,008,0002,113,536
4May 11, 2026 22:1564,48632,629,49122,841,0001,019,0002,113,536
5May 11, 2026 22:1564,59734,371,97822,786,0001,115,0002,113,536
6May 11, 2026 22:1564,63233,415,00222,842,0001,072,0002,113,536
7May 11, 2026 22:1564,91633,758,42022,993,0001,026,0002,113,536
8May 11, 2026 22:1565,11033,218,09022,988,0001,103,0002,113,536
9May 11, 2026 22:1565,14034,259,15422,998,0001,104,0002,113,536