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 10:04Victor MerckléVictor MerckléScore: 56,335Success
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 10:0556,13729,100,09419,736,0001,035,0002,113,536
2Sep 4, 2026 10:0556,14329,885,19919,736,0001,037,0002,113,536
3Sep 4, 2026 10:0556,17529,896,42619,782,0001,003,0002,113,536
4Sep 4, 2026 10:0556,23229,843,51819,769,0001,037,0002,113,536
5Sep 4, 2026 10:0556,33529,203,85619,835,0001,009,0002,113,536
6Sep 4, 2026 10:0556,37229,939,33119,819,0001,039,0002,113,536
7Sep 4, 2026 10:0556,37229,071,25419,855,0001,003,0002,113,536
8Sep 4, 2026 10:0556,38129,957,06519,820,0001,041,0002,113,536
9Sep 4, 2026 10:05143,70062,306,14752,144,0001,025,0002,113,536