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 07:10highload-churnerhighload-churnerScore: 55,262Success
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 07:1155,10529,394,81820,389,000020,480
2Oct 11, 2026 07:1155,13229,405,50520,399,000020,480
3Oct 11, 2026 07:1155,17029,438,68020,413,000020,480
4Oct 11, 2026 07:1155,25429,451,48320,444,000020,480
5Oct 11, 2026 07:1155,26229,518,21120,447,000020,480
6Oct 11, 2026 07:1155,30529,468,46420,463,000020,480
7Oct 11, 2026 07:1155,32429,383,02520,470,000020,480
8Oct 11, 2026 07:1155,34029,470,39420,476,000020,480
9Oct 11, 2026 07:1155,43729,503,92320,512,000020,480