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 19, 2026 08:34Victor MerckléVictor MerckléScore: 63,421Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 08:3562,67530,703,11123,190,00002,113,536
2Jun 19, 2026 08:3563,06730,763,03123,335,00002,113,536
3Jun 19, 2026 08:3563,11030,815,88623,351,00002,113,536
4Jun 19, 2026 08:3563,13230,740,02123,359,00002,113,536
5Jun 19, 2026 08:3563,42132,160,06023,466,00002,113,536
6Jun 19, 2026 08:3563,51331,317,44323,500,00002,113,536
7Jun 19, 2026 08:3563,57031,152,36723,521,00002,113,536
8Jun 19, 2026 08:3563,74831,046,42223,587,00002,113,536
9Jun 19, 2026 08:3563,76731,136,84023,594,00002,113,536