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 04:20highload-churnerhighload-churnerScore: 55,681Success
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 04:2155,55129,497,63620,554,000020,480
2Oct 11, 2026 04:2155,55629,556,15320,556,000020,480
3Oct 11, 2026 04:2155,56229,545,18220,558,000020,480
4Oct 11, 2026 04:2155,60829,592,62920,575,000020,480
5Oct 11, 2026 04:2155,68129,513,11720,602,000020,480
6Oct 11, 2026 04:2155,74829,812,86720,627,000020,480
7Oct 11, 2026 04:2155,77829,566,49820,638,000020,480
8Oct 11, 2026 04:2155,80529,528,61720,648,000020,480
9Oct 11, 2026 04:2155,92429,584,19020,692,000020,480