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 12, 2026 14:28highload-churnerhighload-churnerScore: 62,821Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 14:2962,44833,383,87823,106,000020,480
2Oct 12, 2026 14:2962,53732,278,29723,139,000020,480
3Oct 12, 2026 14:2962,75132,096,02223,218,000020,480
4Oct 12, 2026 14:2962,78132,154,43023,229,000020,480
5Oct 12, 2026 14:2962,82132,128,84223,244,000020,480
6Oct 12, 2026 14:2962,90032,119,35623,273,000020,480
7Oct 12, 2026 14:2962,96432,285,05323,297,000020,480
8Oct 12, 2026 14:2963,12132,275,89923,355,000020,480
9Oct 12, 2026 14:2964,41032,753,99623,832,000020,480