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 08:20Victor MerckléVictor MerckléScore: 63,445Success
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 08:2162,75130,623,08923,218,00002,113,536
2Jun 11, 2026 08:2162,84530,637,03723,253,00002,113,536
3Jun 11, 2026 08:2163,02130,712,62423,318,00002,113,536
4Jun 11, 2026 08:2163,32731,313,36223,431,00002,113,536
5Jun 11, 2026 08:2163,44531,700,78223,475,00002,113,536
6Jun 11, 2026 08:2163,65931,007,60723,554,00002,113,536
7Jun 11, 2026 08:2163,74031,037,45523,584,00002,113,536
8Jun 11, 2026 08:2164,02931,036,43323,691,00002,113,536
9Jun 11, 2026 08:21619,902236,979,076229,364,00002,113,536