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 19:22highload-churnerhighload-churnerScore: 55,110Success
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 19:2354,88929,178,25820,309,000020,480
2Oct 11, 2026 19:2355,02129,268,17320,358,000020,480
3Oct 11, 2026 19:2355,05129,242,43320,369,000020,480
4Oct 11, 2026 19:2355,09129,273,92220,384,000020,480
5Oct 11, 2026 19:2355,11029,294,63920,391,000020,480
6Oct 11, 2026 19:2355,12429,343,58720,396,000020,480
7Oct 11, 2026 19:2355,12730,734,15920,397,000020,480
8Oct 11, 2026 19:2355,13229,256,39720,399,000020,480
9Oct 11, 2026 19:2355,14329,268,97420,403,000020,480