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 listApr 15, 2026 21:42zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 12:05Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 12:0608,907,8761,194,000020,480No answer to stdout. Died or killed?
2Apr 15, 2026 21:442,81645,993,37622,089,0001,004,0002,330,624
3Apr 15, 2026 21:442,81946,972,24822,110,0001,005,0002,322,432
4Apr 15, 2026 21:442,82044,364,32922,115,0001,005,0002,461,696
5Apr 15, 2026 21:422,82646,041,48221,161,0002,015,0002,498,560
6Apr 15, 2026 21:422,85649,822,04721,381,0002,036,0002,461,696
7Apr 15, 2026 21:425,36863,947,26542,017,0002,000,0002,404,352