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 listMay 7, 2023 03:28Yuriy LyfenkoYuriy LyfenkoScore: 5,397Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2023 03:285,355118,540,94143,910,08702,228,224
2May 7, 2023 03:285,397108,186,97244,257,21802,236,416
3May 7, 2023 03:285,562106,795,07745,609,32202,199,552