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:39Victor MerckléVictor MerckléScore: 64,764Success
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:4064,52432,975,09222,739,0001,135,0002,113,536
2Jun 6, 2026 10:4064,57533,020,15222,749,0001,144,0002,113,536
3Jun 6, 2026 10:4064,70533,083,72422,791,0001,150,0002,113,536
4Jun 6, 2026 10:4064,74833,065,70322,802,0001,155,0002,113,536
5Jun 6, 2026 10:4064,76433,100,46722,819,0001,144,0002,113,536
6Jun 6, 2026 10:4064,87233,153,31122,911,0001,092,0002,113,536
7Jun 6, 2026 10:4065,06733,172,58822,928,0001,147,0002,113,536
8Jun 6, 2026 10:4065,09735,439,22422,926,0001,160,0002,113,536
9Jun 6, 2026 10:4065,16433,503,25822,954,0001,157,0002,113,536