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 31, 2021 10:34Ilya AniskovetsIlya AniskovetsScore: 25,434Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2021 10:3425,250275,112,348207,049,12902,244,608
2Oct 31, 2021 10:3425,434268,554,898208,554,92002,244,608
3Oct 31, 2021 10:3425,787276,379,395211,449,80802,248,704