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 21:08Victor MerckléVictor MerckléScore: 71,708Success
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 21:0971,58935,609,72725,467,0001,021,0002,113,536
2Jun 24, 2026 21:0971,61035,621,26725,474,0001,022,0002,113,536
3Jun 24, 2026 21:0971,67235,617,73425,498,0001,021,0002,113,536
4Jun 24, 2026 21:0971,70035,734,79425,508,0001,021,0002,113,536
5Jun 24, 2026 21:0971,70837,030,12925,511,0001,021,0002,113,536
6Jun 24, 2026 21:0971,81635,726,76325,291,0001,281,0002,113,536
7Jun 24, 2026 21:0971,90835,766,90825,314,0001,292,0002,113,536
8Jun 24, 2026 21:0972,02735,773,24625,624,0001,026,0002,113,536
9Jun 24, 2026 21:0972,12135,739,29325,658,0001,027,0002,113,536