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 15:50highload-churnerhighload-churnerScore: 55,483Success
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 15:5155,39129,347,19220,495,000020,480
2Oct 12, 2026 15:5155,44830,776,68620,516,000020,480
3Oct 12, 2026 15:5155,45129,504,07920,517,000020,480
4Oct 12, 2026 15:5155,48129,481,82420,528,000020,480
5Oct 12, 2026 15:5155,48329,421,61020,529,000020,480
6Oct 12, 2026 15:5155,54529,538,64320,552,000020,480
7Oct 12, 2026 15:5155,55632,508,25820,556,000020,480
8Oct 12, 2026 15:5155,55629,367,23720,556,000020,480
9Oct 12, 2026 15:5155,68931,895,59820,605,000020,480