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 22, 2022 15:48Bernard 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 22, 2022 15:4800000Error: expected "2190809998 ", got "3"
2Nov 22, 2022 15:4900000Error: expected "2243795770 ", got "3"
3Nov 22, 2022 15:4900000Error: expected "2145358745 ", got "3"
4Nov 22, 2022 15:4900000Error: expected "2107440484 ", got "3"
5Nov 22, 2022 15:4900000Error: expected "2153442221 ", got "3"