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:34Yuriy LyfenkoYuriy LyfenkoScore: 121,824Success
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:3498,763877,422,062809,855,64702,306,048
2Jun 11, 2021 19:34108,792953,140,470892,092,78702,187,264
3Jun 11, 2021 19:34110,155968,862,275903,272,76502,310,144
4Jun 11, 2021 19:34121,8241,058,841,083998,953,61702,310,144
5Jun 11, 2021 19:34122,8411,070,092,9901,007,295,66602,301,952
6Jun 11, 2021 19:34126,4441,099,155,1381,036,841,66402,301,952