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 19, 2024 19:19zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 12:23Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 12:2309,397,3021,202,000020,480No answer to stdout. Died or killed?
2Oct 19, 2024 19:193,00349,724,70323,600,0001,026,0002,285,568
3Oct 19, 2024 19:193,05747,687,58124,062,0001,002,0002,404,352
4Oct 19, 2024 19:193,06044,873,05923,081,0002,007,0002,355,200