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 listApr 21, 2026 00:47Taylor DettlingTaylor DettlingError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 00:47069,470,78145,106,0005,011,0002,301,952expected "2177396998 ", got "0 "
2Apr 21, 2026 00:47077,636,51545,560,0005,062,0002,318,336expected "2140205710 ", got "0 "
3Apr 21, 2026 00:47071,757,50446,370,0004,032,0002,396,160expected "2002330154 ", got "0 "