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 20:01highload-churnerhighload-churnerScore: 55,132Success
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 20:0254,95929,225,88520,335,000020,480
2Oct 11, 2026 20:0254,96729,187,79920,338,000020,480
3Oct 11, 2026 20:0255,04829,315,12120,368,000020,480
4Oct 11, 2026 20:0255,09729,232,19820,386,000020,480
5Oct 11, 2026 20:0255,13229,272,92220,399,000020,480
6Oct 11, 2026 20:0255,16229,242,94920,410,000020,480
7Oct 11, 2026 20:0255,22429,285,86820,433,000020,480
8Oct 11, 2026 20:0255,24029,310,33920,439,000020,480
9Oct 11, 2026 20:0255,24829,318,40820,442,000020,480