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 listSep 4, 2026 09:10Victor MerckléVictor MerckléScore: 56,291Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 09:1256,08130,740,83120,750,00002,113,536
2Sep 4, 2026 09:1256,18329,081,99319,778,0001,010,0002,113,536
3Sep 4, 2026 09:1256,27229,494,76019,788,0001,033,0002,113,536
4Sep 4, 2026 09:1256,27829,137,61919,812,0001,011,0002,113,536
5Sep 4, 2026 09:1256,29129,913,40819,795,0001,033,0002,113,536
6Sep 4, 2026 09:1256,30229,998,96719,821,0001,011,0002,113,536
7Sep 4, 2026 09:1256,41629,110,34319,870,0001,004,0002,113,536
8Sep 4, 2026 09:1256,54337,823,71919,884,0001,037,0002,113,536
9Sep 4, 2026 09:1256,62729,247,21819,909,0001,043,0002,113,536