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:28Victor MerckléVictor MerckléScore: 63,440Success
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:2863,04330,690,48123,326,00002,113,536
2Jun 10, 2026 15:2863,05930,845,51823,332,00002,113,536
3Jun 10, 2026 15:2863,34031,262,81223,436,00002,113,536
4Jun 10, 2026 15:2863,40031,399,81023,458,00002,113,536
5Jun 10, 2026 15:2863,44030,879,03423,473,00002,113,536
6Jun 10, 2026 15:2863,52930,959,73123,506,00002,113,536
7Jun 10, 2026 15:2863,58630,985,07023,527,00002,113,536
8Jun 10, 2026 15:2863,70831,005,62023,572,00002,113,536
9Jun 10, 2026 15:2863,73231,493,90423,581,00002,113,536