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 listMay 15, 2023 13:29Martin StensgårdMartin StensgårdError
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2023 13:2900000Error: expected "2102045121 ", got "2102001664 "
2May 15, 2023 13:3000000Error: expected "2132191614 ", got "2132148224 "
3May 15, 2023 13:3000000Error: expected "2065055473 ", got "2065039360 "
4May 15, 2023 13:3100000Error: expected "2096297577 ", got "2096234496 "