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 15:15Bernard 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 15:1500000Error: expected "2174725686 ", got "2915703808"
2Sep 11, 2022 15:1600000Error: expected "2228430879 ", got "1"
3Sep 11, 2022 15:1600000Error: expected "2187041949 ", got "3313993029"