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:42Victor MerckléVictor MerckléScore: 64,672Success
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:4364,48634,266,08022,818,0001,042,0002,113,536
2May 11, 2026 23:4364,54334,752,79322,871,0001,010,0002,113,536
3May 11, 2026 23:4364,55134,767,22422,870,0001,014,0002,113,536
4May 11, 2026 23:4364,63234,379,57722,887,0001,027,0002,113,536
5May 11, 2026 23:4364,67234,504,88822,836,0001,093,0002,113,536
6May 11, 2026 23:4364,74532,766,23722,833,0001,123,0002,113,536
7May 11, 2026 23:4364,91834,831,36723,010,0001,010,0002,113,536
8May 11, 2026 23:4364,91833,598,36223,006,0001,014,0002,113,536
9May 11, 2026 23:4364,94533,588,22223,007,0001,023,0002,113,536