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 19, 2022 17:43Bernard 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 19, 2022 17:4300000Error: expected "2044585641 ", got "1"
2Nov 19, 2022 17:4300000Error: expected "2112799300 ", got "1"
3Nov 19, 2022 17:4300000Error: expected "2229965800 ", got "1"
4Nov 19, 2022 17:4300000Error: expected "2239998331 ", got "1"
5Nov 19, 2022 17:4300000Error: expected "2099366195 ", got "1"