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 16:15Victor MerckléVictor MerckléScore: 63,237Success
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 16:1662,95930,695,37323,295,00002,113,536
2Jun 10, 2026 16:1663,06731,268,72223,335,00002,113,536
3Jun 10, 2026 16:1663,08630,738,77823,342,00002,113,536
4Jun 10, 2026 16:1663,10030,726,84322,339,0001,008,0002,113,536
5Jun 10, 2026 16:1663,23731,125,18123,398,00002,113,536
6Jun 10, 2026 16:1663,26230,789,21123,407,00002,113,536
7Jun 10, 2026 16:1663,32930,843,78723,432,00002,113,536
8Jun 10, 2026 16:1663,54831,047,53223,513,00002,113,536
9Jun 10, 2026 16:1663,55430,884,72623,515,00002,113,536