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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 12:20Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 12:2008,822,6691,079,000020,480No answer to stdout. Died or killed?
2Oct 20, 2024 00:183,00249,704,05623,594,0001,025,0002,408,448
3Oct 20, 2024 00:183,03356,352,48522,883,0001,989,0002,310,144
4Oct 20, 2024 00:183,03651,809,35921,910,0002,987,0002,420,736