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 2, 2026 23:41Karthik ReddyKarthik ReddyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 23:41010,481,45601,660,0002,117,632expected "2147266404 ", got "interleaved 1.22 contiguous 19.0 "
2Oct 2, 2026 23:41010,453,63701,659,0002,117,632expected "2236711140 ", got "interleaved 1.95 contiguous 17.4 "
3Oct 2, 2026 23:41010,496,26101,634,0002,117,632expected "2209602389 ", got "interleaved 0.94 contiguous 17.8 "