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 25, 2026 10:51Victor MerckléVictor MerckléScore: 56,964Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 10:5256,84028,533,46620,005,0001,026,0002,113,536
2Jun 25, 2026 10:5256,85928,483,29320,031,0001,007,0002,113,536
3Jun 25, 2026 10:5256,89728,527,36920,010,0001,042,0002,113,536
4Jun 25, 2026 10:5256,92429,904,48120,051,0001,011,0002,113,536
5Jun 25, 2026 10:5256,96429,107,44520,045,0001,032,0002,113,536
6Jun 25, 2026 10:5256,96728,519,57420,043,0001,035,0002,113,536
7Jun 25, 2026 10:5256,97528,543,34420,070,0001,011,0002,113,536
8Jun 25, 2026 10:5257,00228,620,91920,045,0001,046,0002,113,536
9Jun 25, 2026 10:5257,07528,646,19220,113,0001,005,0002,113,536