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 6, 2026 10:24Victor MerckléVictor MerckléScore: 64,454Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 10:2564,10832,779,58422,661,0001,059,0002,113,536
2Jun 6, 2026 10:2564,34333,712,75122,684,0001,123,0002,113,536
3Jun 6, 2026 10:2564,36432,907,98322,675,0001,140,0002,113,536
4Jun 6, 2026 10:2564,45132,929,82922,716,0001,131,0002,113,536
5Jun 6, 2026 10:2564,45435,232,92022,714,0001,134,0002,113,536
6Jun 6, 2026 10:2564,52732,984,50622,733,0001,142,0002,113,536
7Jun 6, 2026 10:2564,78633,100,68222,899,0001,072,0002,113,536
8Jun 6, 2026 10:2564,88133,119,73122,856,0001,150,0002,113,536
9Jun 6, 2026 10:2564,88633,082,11822,876,0001,132,0002,113,536