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 10, 2026 13:05Victor MerckléVictor MerckléScore: 63,008Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 13:0662,49130,480,52423,122,00002,113,536
2Jun 10, 2026 13:0662,53530,520,24623,138,00002,113,536
3Jun 10, 2026 13:0662,68630,589,70223,194,00002,113,536
4Jun 10, 2026 13:0662,80530,597,09923,238,00002,113,536
5Jun 10, 2026 13:0663,00830,714,64823,313,00002,113,536
6Jun 10, 2026 13:0663,05930,717,05323,332,00002,113,536
7Jun 10, 2026 13:0663,26231,030,99023,407,00002,113,536
8Jun 10, 2026 13:0663,42730,814,52023,468,00002,113,536
9Jun 10, 2026 13:0664,10831,526,35622,688,0001,032,0002,113,536