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 listOct 30, 2021 09:40Jules MinierJules MinierScore: 105,199Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 30, 2021 09:40101,362890,040,219831,169,13202,301,952
2Oct 30, 2021 09:40105,199928,946,943862,633,41702,306,048
3Oct 30, 2021 09:40107,539948,209,624881,823,85702,179,072