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 20, 2022 16:47Bernard 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 20, 2022 16:4700000Error: expected "2232542882 ", got "1"
2Nov 20, 2022 16:4700000Error: expected "2321227874 ", got "1"
3Nov 20, 2022 16:4700000Error: expected "1923635331 ", got "1"
4Nov 20, 2022 16:4700000Error: expected "2059030897 ", got "1"
5Nov 20, 2022 16:4800000Error: expected "2008264582 ", got "1"
6Nov 20, 2022 16:4800000Error: expected "2042576985 ", got "1"
7Nov 20, 2022 16:4800000Error: expected "2238185830 ", got "1"