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:04Yuriy LyfenkoYuriy LyfenkoScore: 106,006Success
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:0485,526774,667,742701,311,97402,301,952
2Jun 11, 2021 20:04100,170876,259,367821,391,09602,306,048
3Jun 11, 2021 20:04102,259903,784,413838,525,45202,297,856
4Jun 11, 2021 20:04103,487905,080,207848,591,17302,297,856
5Jun 11, 2021 20:04106,006939,025,033869,249,27802,297,856
6Jun 11, 2021 20:04106,995953,395,540877,355,92202,301,952
7Jun 11, 2021 20:04130,9621,140,025,7881,073,886,47402,314,240
8Jun 11, 2021 20:04140,1041,214,939,7241,148,850,38302,297,856
9Jun 11, 2021 20:04152,2671,309,144,5211,248,587,12502,297,856