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 16:30Yurkov AlekseyYurkov AlekseyScore: 61,303Success
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 16:3258,013541,981,644475,703,12002,297,856
2Jun 13, 2021 16:3258,302535,434,989478,074,33002,293,760
3Jun 13, 2021 16:3259,574550,157,969488,509,45202,293,760
4Jun 13, 2021 16:3260,505555,798,150496,142,08702,293,760
5Jun 13, 2021 16:3260,878566,198,478499,197,66602,297,856
6Jun 13, 2021 16:3061,261566,644,832502,337,44702,174,976
7Jun 13, 2021 16:3061,303565,228,825502,686,04502,285,568
8Jun 13, 2021 16:3061,769573,644,026506,506,82202,293,760
9Jun 13, 2021 16:3072,613674,407,657595,424,29702,297,856
10Jun 13, 2021 16:3274,935686,555,807614,468,55302,297,856
11Jun 13, 2021 16:3076,889683,736,713630,487,09802,289,664
12Jun 13, 2021 16:30126,2121,114,977,0221,034,939,14302,289,664