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 listJul 15, 2026 17:11Maya RebholzMaya RebholzError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 17:11054,400,04142,016,0002,378,00016,384No answer to stdout. Died or killed?
2Jul 15, 2026 17:115,35053,632,88041,322,0002,555,0002,113,536
3Jul 15, 2026 17:115,37253,818,60841,511,0002,540,0002,113,536