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:20Victor MerckléVictor MerckléScore: 64,670Success
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:2164,37532,618,48922,795,0001,024,0002,113,536
2May 11, 2026 23:2164,37532,514,66822,805,0001,014,0002,113,536
3May 11, 2026 23:2164,52935,785,01822,843,0001,033,0002,113,536
4May 11, 2026 23:2164,54532,615,49222,800,0001,082,0002,113,536
5May 11, 2026 23:2164,67033,075,95122,844,0001,084,0002,113,536
6May 11, 2026 23:2164,69133,526,28422,847,0001,089,0002,113,536
7May 11, 2026 23:2164,82433,926,98622,968,0001,017,0002,113,536
8May 11, 2026 23:2164,88635,459,55222,973,0001,035,0002,113,536
9May 11, 2026 23:2165,07535,112,61122,977,0001,101,0002,113,536