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 listDec 25, 2024 02:57Joad NacerJoad NacerError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 13:48Victor Mercklé15.90CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 13:48032,125,38123,207,0001,021,00016,384No answer to stdout. Died or killed?
2Dec 25, 2024 02:573,89756,876,02028,957,0002,995,0002,392,064
3Dec 25, 2024 02:573,98160,110,80332,646,00002,506,752
4Dec 25, 2024 02:574,00563,053,42431,845,000995,0002,383,872