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 listSep 24, 2026 06:46Kevin HeaveyKevin HeaveyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 06:4601,028,730,379929,796,00088,443,00020,480Exit with code 3: n=100000000 in:mode=100600 fs=1021994 fl=8000 out:mode=100600 fs=1021994 fl=8002 sz=0 min=4 max=4294967217 med=2180728133 d=33244485 below2^31=49167560 b16:nz=65536 min=1280 max=2782 medb=1626 h16: 5968 5866 5807 5846 6129 7224 6043 6...stderr