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 listNov 21, 2022 16:20Bernard 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
1Nov 21, 2022 16:2000000Error: expected "2144105078 ", got "6041719 187860 3138685 2144105078"
2Nov 21, 2022 16:2000000Error: expected "2095317310 ", got "6737880 188321 5010329 2"
3Nov 21, 2022 16:2000000Error: expected "2204108356 ", got "5940265 184860 1794074 2204108356"
4Nov 21, 2022 16:2000000Error: expected "2140711508 ", got "6113713 194418 3142378 2140711508"