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 13, 2021 10:14Mikhail ShirokovMikhail ShirokovScore: 21,556Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2021 10:1421,544250,000,837176,660,52902,265,088
2Oct 13, 2021 10:1421,556249,736,766176,759,43202,260,992
3Oct 13, 2021 10:1421,843245,169,592179,110,04302,260,992