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 15, 2026 20:47zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 12:13Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 12:14010,046,3751,024,000020,480No answer to stdout. Died or killed?
2Apr 15, 2026 20:472,81148,041,51321,044,0002,004,0002,338,816
3Apr 15, 2026 20:472,81447,135,11222,070,0001,003,0002,314,240
4Apr 15, 2026 20:472,82143,431,93321,120,0002,011,0002,400,256
5Apr 15, 2026 20:472,83552,717,70620,219,0003,032,0002,310,144
6Apr 15, 2026 20:472,87547,597,66122,553,0001,025,0002,392,064
7Apr 15, 2026 20:475,34176,605,66141,805,0001,990,0002,383,872
8Apr 15, 2026 20:475,34168,611,95542,802,000995,0002,535,424
9Apr 15, 2026 20:475,34869,280,19841,861,0001,993,0002,322,432
10Apr 15, 2026 20:475,62771,066,19444,133,0002,006,0002,334,720