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 15:16Victor MerckléVictor MerckléScore: 63,132Success
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 15:1762,42930,500,91023,099,00002,113,536
2Jun 10, 2026 15:1762,53530,530,50923,138,00002,113,536
3Jun 10, 2026 15:1762,59130,574,05823,159,00002,113,536
4Jun 10, 2026 15:1762,98931,248,87323,306,00002,113,536
5Jun 10, 2026 15:1763,13230,734,82923,359,00002,113,536
6Jun 10, 2026 15:1763,23230,846,10423,396,00002,113,536
7Jun 10, 2026 15:1763,27530,817,79123,412,00002,113,536
8Jun 10, 2026 15:1763,47230,951,43722,477,0001,008,0002,113,536
9Jun 10, 2026 15:17629,435240,271,942232,891,00002,113,536