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 11:21Victor MerckléVictor MerckléScore: 63,110Success
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 11:2262,67230,545,93623,189,00002,113,536
2Jun 11, 2026 11:2262,67830,629,85023,191,00002,113,536
3Jun 11, 2026 11:2262,84030,629,75923,251,00002,113,536
4Jun 11, 2026 11:2262,86430,663,90923,260,00002,113,536
5Jun 11, 2026 11:2263,11030,734,49923,351,00002,113,536
6Jun 11, 2026 11:2263,15430,761,94323,367,00002,113,536
7Jun 11, 2026 11:2263,21330,767,56823,389,00002,113,536
8Jun 11, 2026 11:2263,67231,561,36323,559,00002,113,536
9Jun 11, 2026 11:2263,70031,022,33623,569,00002,113,536