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 17:14highload-churnerhighload-churnerScore: 55,251Success
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 17:1554,93730,892,55120,327,000020,480
2Oct 11, 2026 17:1554,96229,218,26920,336,000020,480
3Oct 11, 2026 17:1555,00029,037,17820,350,000020,480
4Oct 11, 2026 17:1555,16429,316,92720,411,000020,480
5Oct 11, 2026 17:1555,25129,380,76520,443,000020,480
6Oct 11, 2026 17:1555,25929,366,24320,446,000020,480
7Oct 11, 2026 17:1555,35929,191,96520,483,000020,480
8Oct 11, 2026 17:1555,42429,384,93420,507,000020,480
9Oct 11, 2026 17:1555,53730,934,97320,549,000020,480