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:20highload-churnerhighload-churnerScore: 109,794Success
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:21109,61349,407,59840,557,000020,480
2Oct 12, 2026 14:21109,66449,318,84040,576,000020,480
3Oct 12, 2026 14:21109,72449,500,91240,598,000020,480
4Oct 12, 2026 14:21109,74050,856,86740,604,000020,480
5Oct 12, 2026 14:21109,79449,490,60640,624,000020,480
6Oct 12, 2026 14:21109,81349,537,32940,631,000020,480
7Oct 12, 2026 14:21109,83549,538,88640,639,000020,480
8Oct 12, 2026 14:21109,87049,516,78640,652,000020,480
9Oct 12, 2026 14:21110,03549,645,12140,713,000020,480