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 20:17Victor MerckléVictor MerckléScore: 65,681Success
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 20:1865,37234,810,28223,166,0001,022,0002,113,536
2May 11, 2026 20:1865,50233,524,68323,152,0001,084,0002,113,536
3May 11, 2026 20:1865,62433,054,74523,188,0001,093,0002,113,536
4May 11, 2026 20:1865,65634,972,47823,209,0001,084,0002,113,536
5May 11, 2026 20:1865,68135,903,88723,214,0001,088,0002,113,536
6May 11, 2026 20:1865,69433,085,03823,211,0001,096,0002,113,536
7May 11, 2026 20:1866,00535,164,95823,335,0001,087,0002,113,536
8May 11, 2026 20:1866,04835,157,92323,349,0001,089,0002,113,536
9May 11, 2026 20:1866,12133,912,36123,348,0001,117,0002,113,536