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 listSep 12, 2026 09:50Haha ExpertHaha ExpertScore: 83,829Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 09:5182,65139,162,86529,571,0001,010,0002,117,632
2Sep 12, 2026 09:5182,86739,431,75729,632,0001,029,0002,117,632
3Sep 12, 2026 09:5183,23540,274,24329,760,0001,037,0002,117,632
4Sep 12, 2026 09:5183,27539,456,67629,657,0001,155,0002,117,632
5Sep 12, 2026 09:5183,82939,691,21329,990,0001,027,0002,117,632
6Sep 12, 2026 09:5183,84339,611,91830,000,0001,022,0002,117,632
7Sep 12, 2026 09:5183,93239,544,88630,016,0001,039,0002,117,632
8Sep 12, 2026 09:5183,98339,603,15730,040,0001,034,0002,117,632
9Sep 12, 2026 09:5184,92940,463,87630,212,0001,212,0002,117,632