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 19:44highload-churnerhighload-churnerScore: 55,645Success
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 19:4555,44829,278,73120,516,000020,480
2Oct 11, 2026 19:4555,48329,394,06120,529,000020,480
3Oct 11, 2026 19:4555,61629,330,61720,578,000020,480
4Oct 11, 2026 19:4555,63529,376,93720,585,000020,480
5Oct 11, 2026 19:4555,64529,509,72020,589,000020,480
6Oct 11, 2026 19:4555,70829,474,63420,612,000020,480
7Oct 11, 2026 19:4555,73729,502,01720,623,000020,480
8Oct 11, 2026 19:4555,75429,496,59420,629,000020,480
9Oct 11, 2026 19:4556,12129,698,77220,765,000020,480