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 listJun 24, 2026 22:08Victor MerckléVictor MerckléScore: 70,940Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 22:0970,77035,265,00324,978,0001,207,0002,113,536
2Jun 24, 2026 22:0970,78135,235,18824,975,0001,214,0002,113,536
3Jun 24, 2026 22:0970,78135,249,35124,986,0001,203,0002,113,536
4Jun 24, 2026 22:0970,86735,292,34225,084,0001,137,0002,113,536
5Jun 24, 2026 22:0970,94035,325,12725,044,0001,204,0002,113,536
6Jun 24, 2026 22:0970,97535,369,12225,026,0001,235,0002,113,536
7Jun 24, 2026 22:0971,20835,485,10725,093,0001,254,0002,113,536
8Jun 24, 2026 22:0971,21335,455,78325,135,0001,214,0002,113,536
9Jun 24, 2026 22:0971,22135,412,34725,121,0001,231,0002,113,536