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 00:45Victor MerckléVictor MerckléScore: 59,048Success
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 00:4558,76729,209,17021,744,00002,113,536
2Jun 25, 2026 00:4558,90229,369,62021,794,00002,113,536
3Jun 25, 2026 00:4558,95929,855,68320,808,0001,007,0002,113,536
4Jun 25, 2026 00:4559,03729,277,05520,811,0001,033,0002,113,536
5Jun 25, 2026 00:4559,04829,537,08620,812,0001,036,0002,113,536
6Jun 25, 2026 00:4559,09729,595,46020,821,0001,045,0002,113,536
7Jun 25, 2026 00:4559,18129,925,58220,856,0001,041,0002,113,536
8Jun 25, 2026 00:4559,25129,377,12720,889,0001,034,0002,113,536
9Jun 25, 2026 00:4559,25929,392,03220,912,0001,014,0002,113,536