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 20, 2021 13:20Andrey TsvetkovAndrey TsvetkovScore: 109,398Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2021 13:1980,149735,659,348657,218,18602,297,856
2Jun 20, 2021 13:1980,483722,841,629659,961,29302,191,360
3Jun 20, 2021 13:19100,603881,948,987824,941,31202,195,456
4Jun 20, 2021 13:20105,815930,615,649867,684,16802,301,952
5Jun 20, 2021 13:19109,398987,483,978897,065,98702,285,568
6Jun 20, 2021 13:20110,957985,036,488909,847,97902,195,456
7Jun 20, 2021 13:19117,7901,023,631,975965,873,97302,306,048
8Jun 20, 2021 13:20119,9371,039,599,518983,479,39502,301,952
9Jun 20, 2021 13:19120,1421,040,755,874985,163,74002,310,144