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 18:10highload-churnerhighload-churnerScore: 56,486Success
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 18:1256,39130,461,10120,865,000020,480
2Oct 9, 2026 18:1256,42129,832,28320,876,000020,480
3Oct 9, 2026 18:1256,43229,880,44020,880,000020,480
4Oct 9, 2026 18:1256,44029,979,04720,883,000020,480
5Oct 9, 2026 18:1256,48629,898,11620,900,000020,480
6Oct 9, 2026 18:1256,56229,992,21520,928,000020,480
7Oct 9, 2026 18:1256,56229,889,04520,928,000020,480
8Oct 9, 2026 18:1256,60829,961,69320,945,000020,480
9Oct 9, 2026 18:1256,61030,049,20220,946,000020,480