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 listOct 11, 2026 20:54highload-churnerhighload-churnerScore: 57,259Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2026 20:5557,01029,962,74620,071,0001,023,00032,768
2Oct 11, 2026 20:5557,06229,904,42720,093,0001,020,00032,768
3Oct 11, 2026 20:5557,09429,878,56920,104,0001,021,00036,864
4Oct 11, 2026 20:5557,20230,034,10820,141,0001,024,00032,768
5Oct 11, 2026 20:5557,25930,057,70420,164,0001,022,00032,768
6Oct 11, 2026 20:5557,27530,182,32020,170,0001,022,00036,864
7Oct 11, 2026 20:5557,30230,020,00220,177,0001,025,00032,768
8Oct 11, 2026 20:5557,53230,116,10220,264,0001,023,00028,672
9Oct 11, 2026 20:5557,72930,376,98020,324,0001,036,00036,864