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 listJul 5, 2026 13:59zielajzielajScore: 2,680Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 16:06Victor Mercklé124.19CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 14:012,64633,825,68020,460,0001,239,0002,121,728stderr
2Jul 5, 2026 14:012,65529,729,99520,569,0001,207,0002,121,728stderr
3Jul 5, 2026 14:012,65829,799,29720,528,0001,271,0002,121,728stderr
4Jul 5, 2026 14:012,67329,933,55820,610,0001,315,0002,121,728stderr
5Jul 5, 2026 14:012,68030,661,09820,911,0001,069,0002,121,728stderr
6Jul 5, 2026 14:012,68130,006,85320,928,0001,059,0002,121,728stderr
7Jul 5, 2026 14:0194,083780,005,261678,634,00092,854,0002,121,728stderr
8Jul 5, 2026 14:01101,241838,222,057737,619,00092,558,0002,121,728stderr
9Jul 5, 2026 14:01114,978950,989,404846,963,00095,861,0002,121,728stderr