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 listOct 20, 2024 00:21zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 12:18Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 12:1808,789,7391,058,000020,480No answer to stdout. Died or killed?
2Oct 20, 2024 00:212,98444,026,05423,453,0001,019,0002,326,528
3Oct 20, 2024 00:212,99651,129,89123,545,0001,023,0002,441,216
4Oct 20, 2024 00:213,01150,728,38424,689,00002,498,560