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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 12:19Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 12:1908,789,4641,059,000020,480No answer to stdout. Died or killed?
2Oct 20, 2024 00:303,00252,681,04422,562,0002,051,0002,400,256
3Oct 20, 2024 00:303,00349,213,00624,621,00002,322,432
4Oct 20, 2024 00:303,01350,739,69324,704,00002,416,640