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:46highload-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:472,49630,905,07720,473,000020,480
2Oct 13, 2026 14:472,49629,402,88920,472,000020,480
3Oct 13, 2026 14:472,49629,510,34220,470,000020,480
4Oct 13, 2026 14:472,49729,494,28820,479,000020,480
5Oct 13, 2026 14:472,49829,463,02020,490,000020,480
6Oct 13, 2026 14:472,49929,520,13120,496,000020,480
7Oct 13, 2026 14:472,49929,544,47120,495,000020,480
8Oct 13, 2026 14:472,50029,566,88120,507,000020,480
9Oct 13, 2026 14:472,51029,310,66720,582,000020,480