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 3, 2026 01:52Karthik ReddyKarthik ReddyScore: 2,493Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 3, 2026 01:532,48529,410,70220,385,000020,480
2Oct 3, 2026 01:532,48729,949,37620,394,000020,480
3Oct 3, 2026 01:532,48829,450,43520,405,000020,480
4Oct 3, 2026 01:532,49229,412,69320,441,000020,480
5Oct 3, 2026 01:532,49329,582,70620,443,000020,480
6Oct 3, 2026 01:532,49429,536,67220,455,000020,480
7Oct 3, 2026 01:532,49629,577,90720,473,000020,480
8Oct 3, 2026 01:532,50029,554,63720,505,000020,480
9Oct 3, 2026 01:532,50029,598,19820,503,000020,480