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 25, 2022 17:31Bernard 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 25, 2022 17:3100000Error: expected "2040162739 ", got "1"
2Nov 25, 2022 17:3100000Error: expected "2114637727 ", got "1"
3Nov 25, 2022 17:3100000Error: expected "2211747220 ", got "1"
4Nov 25, 2022 17:3200000Error: expected "2161668905 ", got "1"
5Nov 25, 2022 17:3200000Error: expected "2110267446 ", got "1"
6Nov 25, 2022 17:3200000Error: expected "2093370444 ", got "1"
7Nov 25, 2022 17:3300000Error: expected "2081093379 ", got "1"