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 listJun 13, 2021 15:51Yurkov AlekseyYurkov AlekseyScore: 85,218Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2021 15:5168,990633,806,917565,716,95302,260,992
2Jun 13, 2021 15:5185,218759,939,609698,791,32802,301,952
3Jun 13, 2021 15:5197,217872,944,779797,182,87902,293,760