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 11, 2026 09:07Victor MerckléVictor MerckléScore: 63,402Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 09:0862,89430,808,24723,271,00002,113,536
2Jun 11, 2026 09:0862,98130,916,12623,303,00002,113,536
3Jun 11, 2026 09:0863,27232,398,22623,411,00002,113,536
4Jun 11, 2026 09:0863,34330,807,70123,437,00002,113,536
5Jun 11, 2026 09:0863,40230,863,61223,459,00002,113,536
6Jun 11, 2026 09:0863,67231,000,78223,559,00002,113,536
7Jun 11, 2026 09:0863,67531,072,81623,560,00002,113,536
8Jun 11, 2026 09:0863,77031,292,17123,595,00002,113,536
9Jun 11, 2026 09:0863,79732,270,83723,605,00002,113,536