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 19, 2026 08:21Victor MerckléVictor MerckléScore: 62,913Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 08:2262,60230,733,62523,163,00002,113,536
2Jun 19, 2026 08:2262,70030,721,66423,199,00002,113,536
3Jun 19, 2026 08:2262,81330,724,80223,241,00002,113,536
4Jun 19, 2026 08:2262,84830,746,83823,254,00002,113,536
5Jun 19, 2026 08:2262,91332,671,56823,278,00002,113,536
6Jun 19, 2026 08:2263,05630,890,89723,331,00002,113,536
7Jun 19, 2026 08:2263,05930,811,19323,332,00002,113,536
8Jun 19, 2026 08:2263,10230,881,66523,348,00002,113,536
9Jun 19, 2026 08:2263,43531,069,60923,471,00002,113,536