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 listNov 26, 2023 14:33mmalczakmmalczakScore: 71,917Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 26, 2023 14:3369,559629,797,348570,382,40302,174,976
2Nov 26, 2023 14:3469,667637,881,019571,272,20902,187,264
3Nov 26, 2023 14:3470,118629,069,135574,967,80802,297,856
4Nov 26, 2023 14:3370,460638,644,800577,774,39802,183,168
5Nov 26, 2023 14:3371,917649,416,679589,720,47002,174,976
6Nov 26, 2023 14:3372,481654,259,046594,344,62202,301,952
7Nov 26, 2023 14:3377,089684,627,577632,126,22102,174,976
8Nov 26, 2023 14:3380,240730,305,573657,965,79402,297,856
9Nov 26, 2023 14:3497,071854,998,053795,985,25102,183,168