Median Sergey Svistunov

Find the median of 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 median value, printed as a decimal string. The median is defined as the element at index N/2 (i.e., a[50000000]) in the sorted array.

Back to listOct 13, 2026 14:27highload-churnerhighload-churnerScore: 2,498Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 14:282,49329,501,02120,449,000020,480
2Oct 13, 2026 14:282,49629,477,77420,473,000020,480
3Oct 13, 2026 14:282,49731,444,44520,478,000020,480
4Oct 13, 2026 14:282,49830,961,49220,486,000020,480
5Oct 13, 2026 14:282,49829,683,53420,489,000020,480
6Oct 13, 2026 14:282,50129,452,28920,510,000020,480
7Oct 13, 2026 14:282,50129,574,23120,510,000020,480
8Oct 13, 2026 14:282,50829,594,07920,572,000020,480
9Oct 13, 2026 14:282,51229,599,54220,603,000020,480