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 00:57Victor MerckléVictor MerckléScore: 69,635Success
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 00:5869,50834,695,29524,643,0001,075,0002,113,536
2May 12, 2026 00:5869,55936,240,40424,655,0001,082,0002,113,536
3May 12, 2026 00:5869,60037,486,28024,646,0001,106,0002,113,536
4May 12, 2026 00:5869,60036,783,61524,662,0001,090,0002,113,536
5May 12, 2026 00:5869,63535,264,43124,692,0001,073,0002,113,536
6May 12, 2026 00:5869,69437,311,68324,693,0001,094,0002,113,536
7May 12, 2026 00:5869,98335,049,32624,865,0001,029,0002,113,536
8May 12, 2026 00:5870,09135,681,71624,838,0001,096,0002,113,536
9May 12, 2026 00:5870,10836,114,27124,845,0001,095,0002,113,536