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 12, 2026 01:00Victor MerckléVictor MerckléScore: 69,000Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 01:0168,68934,997,03824,394,0001,021,0002,113,536
2May 12, 2026 01:0168,85934,265,01624,392,0001,086,0002,113,536
3May 12, 2026 01:0168,91834,307,64824,409,0001,091,0002,113,536
4May 12, 2026 01:0168,94035,967,45824,433,0001,075,0002,113,536
5May 12, 2026 01:0169,00036,469,82424,432,0001,098,0002,113,536
6May 12, 2026 01:0169,06736,416,86424,420,0001,135,0002,113,536
7May 12, 2026 01:0169,18335,667,97624,585,0001,013,0002,113,536
8May 12, 2026 01:0169,32934,428,70124,558,0001,094,0002,113,536
9May 12, 2026 01:0169,37036,196,63224,587,0001,080,0002,113,536