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 11, 2021 19:28Yuriy LyfenkoYuriy LyfenkoScore: 115,929Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2021 19:2875,001690,745,417615,008,50002,179,072
2Jun 11, 2021 19:28115,9291,016,713,472950,614,17902,293,760
3Jun 11, 2021 19:28121,8621,061,995,551999,265,53102,183,168