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 13, 2021 10:54Yurkov AlekseyYurkov AlekseyScore: 103,952Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2021 09:0681,746739,413,801670,316,70002,297,856
2Jun 13, 2021 10:5484,663761,968,394694,236,19402,293,760
3Jun 13, 2021 09:0690,318800,523,949740,606,08102,306,048
4Jun 13, 2021 10:5590,439798,814,959741,600,46002,179,072
5Jun 13, 2021 09:06103,952911,651,419852,405,97402,293,760
6Jun 13, 2021 10:55105,680931,667,069866,576,70702,301,952
7Jun 13, 2021 10:54107,163944,277,794878,739,91202,293,760
8Jun 13, 2021 10:55110,290961,247,835904,382,05402,179,072
9Jun 13, 2021 10:54121,4731,069,826,146996,080,24402,174,976