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 9, 2026 21:03Victor MerckléVictor MerckléScore: 64,135Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 21:0463,98632,673,34522,530,0001,145,0002,117,632
2Jun 9, 2026 21:0464,02732,660,98922,535,0001,155,0002,113,536
3Jun 9, 2026 21:0464,04332,699,95922,539,0001,157,0002,113,536
4Jun 9, 2026 21:0464,11032,760,56822,575,0001,146,0002,113,536
5Jun 9, 2026 21:0464,13532,690,98222,584,0001,146,0002,113,536
6Jun 9, 2026 21:0464,15632,715,11122,586,0001,152,0002,113,536
7Jun 9, 2026 21:0464,51332,919,51122,720,0001,150,0002,113,536
8Jun 9, 2026 21:0464,54334,426,65322,861,0001,020,0002,113,536
9Jun 9, 2026 21:0464,56232,959,20222,745,0001,143,0002,113,536