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:39Yuriy LyfenkoYuriy LyfenkoScore: 106,688Success
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:3983,048748,285,516680,992,20302,306,048
2Jun 11, 2021 19:3886,431767,040,650708,733,07202,306,048
3Jun 11, 2021 19:3989,328791,332,398732,491,59302,301,952
4Jun 11, 2021 19:3994,861840,148,417777,860,54502,301,952
5Jun 11, 2021 19:38103,227910,811,059846,458,86502,306,048
6Jun 11, 2021 19:39104,310921,422,988855,340,61402,297,856
7Jun 11, 2021 19:39106,688938,674,714874,843,70402,293,760
8Jun 11, 2021 19:39110,942969,609,324909,728,00402,314,240
9Jun 11, 2021 19:39111,739991,748,884916,261,10102,301,952
10Jun 11, 2021 19:39112,059996,178,914918,880,23502,306,048
11Jun 11, 2021 19:39123,2201,062,236,1581,010,405,18802,310,144
12Jun 11, 2021 19:38140,6161,222,189,7581,153,049,82702,306,048