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 listMar 20, 2026 14:24olliecrowolliecrowScore: 21,296Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 14:243,27353,180,54624,848,0001,987,0002,506,752
2Mar 20, 2026 14:243,27654,577,04422,885,0003,980,0002,379,776
3Mar 20, 2026 14:243,28854,828,98824,968,0001,997,0002,367,488
4Mar 20, 2026 14:243,34254,088,38726,390,0001,015,0002,506,752
5Mar 20, 2026 14:2421,296206,242,766172,632,0001,995,0002,510,848
6Mar 20, 2026 14:2421,369199,901,241174,225,0001,001,0002,342,912
7Mar 20, 2026 14:2421,419208,365,745172,644,0002,993,0002,301,952
8Mar 20, 2026 14:2421,473198,448,631174,077,0002,000,0002,510,848
9Mar 20, 2026 14:2421,741213,204,552176,273,0002,003,0002,347,008