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:26Yuriy LyfenkoYuriy LyfenkoScore: 119,938Success
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:2699,532887,497,891816,164,15602,306,048
2Jun 11, 2021 19:26112,904986,263,824925,816,86002,293,760
3Jun 11, 2021 19:26119,3601,051,510,217978,751,86302,289,664
4Jun 11, 2021 19:26119,9381,043,933,606983,493,93802,297,856
5Jun 11, 2021 19:26121,6311,068,300,565997,376,96102,174,976
6Jun 11, 2021 19:26138,0151,195,877,7721,131,726,06902,297,856