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 listMay 6, 2025 20:16Aniruddha DebAniruddha DebError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 5, 2026 21:07Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 21:16020,028,945,71819,915,062,000104,350,00016,384Killed by timeout
2May 6, 2025 20:1611,675123,766,19393,744,0001,994,0002,281,472
3May 6, 2025 20:1611,681120,640,08094,791,000997,0002,306,048
4May 6, 2025 20:1611,756117,903,29494,393,0002,008,0002,314,240
5May 6, 2025 20:1611,796122,235,17295,727,000997,0002,441,216
6May 6, 2025 20:1611,808126,389,90194,831,0001,996,0002,441,216
7May 6, 2025 20:1611,847117,757,43396,142,0001,001,0002,297,856
8May 6, 2025 20:1611,989122,023,38398,311,00002,347,008
9May 6, 2025 20:1612,107119,561,93599,275,00002,285,568
10May 6, 2025 20:1612,353119,380,441100,294,0001,002,0002,404,352