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 20:19Victor MerckléVictor MerckléScore: 64,713Success
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 20:2064,47534,261,95322,841,0001,015,0002,113,536
2May 11, 2026 20:2064,58334,281,45522,877,0001,019,0002,113,536
3May 11, 2026 20:2064,61633,059,35122,893,0001,015,0002,113,536
4May 11, 2026 20:2064,63235,432,34722,831,0001,083,0002,113,536
5May 11, 2026 20:2064,71334,342,13822,840,0001,104,0002,113,536
6May 11, 2026 20:2064,78334,385,94222,880,0001,090,0002,113,536
7May 11, 2026 20:2064,92735,600,10223,015,0001,008,0002,113,536
8May 11, 2026 20:2064,92932,803,04123,018,0001,006,0002,113,536
9May 11, 2026 20:2065,02434,797,09523,036,0001,023,0002,113,536