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 18, 2026 05:28Victor MerckléVictor MerckléScore: 62,945Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 05:2962,56235,269,22823,148,00002,113,536
2Jun 18, 2026 05:2962,75630,653,64423,220,00002,113,536
3Jun 18, 2026 05:2962,82430,857,75323,245,00002,113,536
4Jun 18, 2026 05:2962,92930,925,87723,284,00002,113,536
5Jun 18, 2026 05:2962,94530,708,22223,290,00002,113,536
6Jun 18, 2026 05:2963,01330,750,40222,293,0001,022,0002,113,536
7Jun 18, 2026 05:2963,02730,946,30923,320,00002,113,536
8Jun 18, 2026 05:2963,44331,416,90223,474,00002,113,536
9Jun 18, 2026 05:2963,78931,622,19723,602,00002,113,536