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 12:24Victor MerckléVictor MerckléScore: 63,564Success
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 12:2562,93530,727,16323,286,00002,113,536
2Jun 24, 2026 12:2563,45130,925,54623,477,00002,113,536
3Jun 24, 2026 12:2563,56230,987,31723,518,00002,113,536
4Jun 24, 2026 12:2563,56431,074,82123,519,00002,113,536
5Jun 24, 2026 12:2563,56431,554,28223,519,00002,113,536
6Jun 24, 2026 12:2563,68131,355,77923,562,00002,113,536
7Jun 24, 2026 12:2563,86231,906,80423,629,00002,113,536
8Jun 24, 2026 12:2564,41031,893,61723,832,00002,113,536
9Jun 24, 2026 12:25625,021239,303,557230,248,0001,010,0002,113,536