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 24, 2026 14:01Victor MerckléVictor MerckléScore: 101,310Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 14:02100,73245,295,72837,271,00002,117,632stderr
2Jun 24, 2026 14:02100,78945,308,80236,290,0001,002,0002,117,632stderr
3Jun 24, 2026 14:02100,99445,466,90536,368,0001,000,0002,117,632stderr
4Jun 24, 2026 14:02101,17046,963,02537,433,00002,117,632stderr
5Jun 24, 2026 14:02101,31045,466,04736,480,0001,005,0002,117,632stderr
6Jun 24, 2026 14:02101,33545,157,75237,494,00002,117,632stderr
7Jun 24, 2026 14:02101,42445,613,73237,527,00002,117,632stderr
8Jun 24, 2026 14:02101,47245,180,42036,537,0001,008,0002,117,632stderr
9Jun 24, 2026 14:02664,748254,021,794245,957,00002,117,632stderr