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 30, 2026 12:55Dominique GarmierDominique GarmierError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 13:35Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 13:36012,528,5851,635,0001,635,00024,576No answer to stdout. Died or killed?
2Mar 30, 2026 12:553,78256,571,62027,012,0004,001,0002,375,680
3Mar 30, 2026 12:553,80452,692,59029,179,0002,012,0002,428,928
4Mar 30, 2026 12:5513,180130,406,789105,071,0003,002,0002,531,328