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:15zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 12:16Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 12:1708,841,8401,081,000020,480No answer to stdout. Died or killed?
2Oct 20, 2024 00:152,98947,449,07323,488,0001,021,0002,387,968
3Oct 20, 2024 00:152,99544,023,01920,468,0004,093,0002,428,928
4Oct 20, 2024 00:153,03158,272,55020,878,0003,976,0002,330,624