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 listJul 15, 2021 22:34Mikhail ShirokovMikhail ShirokovScore: 96,512Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2021 22:3490,167804,422,969739,365,72102,281,472
2Jul 15, 2021 22:3496,512857,199,060791,397,75202,281,472
3Jul 15, 2021 22:34109,035952,218,312894,088,43502,281,472