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 12, 2021 17:41Yuriy LyfenkoYuriy LyfenkoScore: 43,705Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2021 17:4132,343321,407,413265,211,96102,297,856
2Jun 12, 2021 17:4133,464329,404,430274,404,72902,297,856
3Jun 12, 2021 17:4141,924405,362,072343,773,15302,297,856
4Jun 12, 2021 17:4143,705425,094,697358,383,27202,297,856
5Jun 12, 2021 17:4143,842424,510,509359,501,67202,293,760
6Jun 12, 2021 17:4145,074429,402,758369,604,93702,301,952