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:22Yuriy LyfenkoYuriy LyfenkoScore: 124,805Success
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:22117,2811,020,547,228961,702,50702,297,856
2Jun 11, 2021 19:22124,8051,084,259,8661,023,404,88502,297,856
3Jun 11, 2021 19:22153,9661,316,531,6241,262,517,24302,301,952