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 9, 2026 20:31highload-churnerhighload-churnerScore: 58,564Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 20:4458,31330,578,89121,576,000020,480
2Oct 9, 2026 20:4458,40230,551,23521,609,000020,480
3Oct 9, 2026 20:4458,41830,596,49421,615,000020,480
4Oct 9, 2026 20:4458,43230,677,80721,620,000020,480
5Oct 9, 2026 20:4458,56430,653,25521,669,000020,480
6Oct 9, 2026 20:4458,57830,697,56021,674,000020,480
7Oct 9, 2026 20:4458,63530,710,99921,695,000020,480
8Oct 9, 2026 20:4458,66430,679,38621,706,000020,480
9Oct 9, 2026 20:4459,20232,324,09821,905,000020,480