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 20:08Yuriy LyfenkoYuriy LyfenkoScore: 115,549Success
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 20:08102,640904,688,002841,651,63302,297,856
2Jun 11, 2021 20:09102,876912,530,528843,581,86402,297,856
3Jun 11, 2021 20:08108,279942,479,580887,889,92902,301,952
4Jun 11, 2021 20:09111,153970,849,398911,456,73502,293,760
5Jun 11, 2021 20:08115,5491,017,795,169947,498,76102,306,048
6Jun 11, 2021 20:08117,3391,025,883,699962,180,65902,297,856
7Jun 11, 2021 20:08126,0181,091,645,5981,033,351,04302,281,472
8Jun 11, 2021 20:08133,5291,157,072,9621,094,936,68602,306,048
9Jun 11, 2021 20:09134,2331,171,237,1461,100,707,32802,306,048