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 15:20Victor MerckléVictor MerckléScore: 70,794Success
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 15:2170,58136,621,35324,970,0001,145,0002,113,536
2May 11, 2026 15:2170,69735,670,54125,005,0001,153,0002,113,536
3May 11, 2026 15:2170,78137,158,61324,954,0001,235,0002,113,536
4May 11, 2026 15:2170,78334,988,25925,051,0001,139,0002,113,536
5May 11, 2026 15:2170,79437,889,29125,037,0001,157,0002,113,536
6May 11, 2026 15:2170,86437,243,93525,060,0001,160,0002,113,536
7May 11, 2026 15:2171,10036,087,18025,131,0001,176,0002,113,536
8May 11, 2026 15:2171,11635,069,32225,141,0001,172,0002,113,536
9May 11, 2026 15:2171,13235,891,44025,135,0001,184,0002,113,536