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 listMay 11, 2026 21:04Victor MerckléVictor MerckléScore: 68,716Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 21:0568,43235,722,31624,305,0001,015,0002,113,536
2May 11, 2026 21:0568,55634,172,93424,287,0001,079,0002,113,536
3May 11, 2026 21:0568,61634,050,39024,368,0001,020,0002,117,632
4May 11, 2026 21:0568,64336,148,24024,302,0001,096,0002,113,536
5May 11, 2026 21:0568,71635,896,18724,342,0001,083,0002,113,536
6May 11, 2026 21:0568,77536,039,23624,359,0001,088,0002,113,536
7May 11, 2026 21:0568,94034,757,96224,487,0001,021,0002,113,536
8May 11, 2026 21:0569,09736,196,67424,485,0001,081,0002,113,536
9May 11, 2026 21:0569,10237,214,93824,479,0001,089,0002,113,536