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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 12:51Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 12:5108,901,1701,095,000020,480No answer to stdout. Died or killed?
2Oct 19, 2024 18:003,39955,698,84425,879,0001,990,0002,338,816
3Oct 19, 2024 18:003,48250,670,20127,568,000984,0002,490,368
4Oct 19, 2024 18:003,53952,504,00128,021,0001,000,0002,273,280