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 12, 2021 21:00Yuriy LyfenkoYuriy LyfenkoScore: 113,077Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2021 21:0090,723811,062,729743,932,58302,228,224
2Jun 12, 2021 21:0197,376862,732,276798,485,51502,211,840
3Jun 12, 2021 21:00101,817914,069,003834,901,46002,215,936
4Jun 12, 2021 21:01109,200951,036,917895,439,75202,220,032
5Jun 12, 2021 21:01111,453983,221,219913,911,68302,207,744
6Jun 12, 2021 21:00113,059994,610,632927,085,22802,228,224
7Jun 12, 2021 21:00113,077998,162,568927,234,80102,215,936
8Jun 12, 2021 21:00119,8571,042,977,486982,824,92102,224,128
9Jun 12, 2021 21:00120,0761,056,967,183984,624,92002,224,128
10Jun 12, 2021 21:00121,5451,059,198,625996,671,16602,215,936
11Jun 12, 2021 21:00125,6211,088,781,0451,030,089,18702,207,744
12Jun 12, 2021 21:00164,2931,420,388,3441,347,199,21002,220,032