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 25, 2023 14:39mmalczakmmalczakScore: 950,970Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 25, 2023 14:39950,0587,853,608,2367,790,472,05702,293,760
2Nov 25, 2023 14:39950,9707,861,966,8587,797,956,49802,293,760
3Nov 25, 2023 14:39951,7037,875,069,6537,803,965,66902,297,856