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 listSep 11, 2022 14:17Bernard TeoBernard TeoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2022 14:1700000Error: expected "2139610227 ", got "1"
2Sep 11, 2022 14:1700000Error: expected "2059802259 ", got "1"
3Sep 11, 2022 14:2400000Error: expected "2133470248 ", got "1"
4Sep 11, 2022 14:2400000Error: expected "2217256273 ", got "1"
5Sep 11, 2022 14:2400000Error: expected "2166919065 ", got "1"
6Sep 11, 2022 14:2400000Error: expected "2180100898 ", got "1"
7Sep 11, 2022 14:2500000Error: expected "2105000546 ", got "1"