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:22Yuriy LyfenkoYuriy LyfenkoScore: 122,712Success
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:22107,365940,542,365880,394,90602,211,840
2Jun 12, 2021 21:22122,7121,072,651,2671,006,241,27502,224,128
3Jun 12, 2021 21:22129,2301,112,884,2791,059,685,00602,220,032