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 17:41Yuriy LyfenkoYuriy LyfenkoScore: 32,864Success
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 17:4132,215315,189,259264,163,78302,191,360
2Jun 12, 2021 17:4132,348328,590,794265,250,63902,293,760
3Jun 12, 2021 17:4132,773330,501,387268,739,42602,306,048
4Jun 12, 2021 17:4132,864336,827,068269,485,82602,293,760
5Jun 12, 2021 17:4132,933343,019,417270,051,29802,293,760
6Jun 12, 2021 17:4143,871421,121,326359,742,04102,293,760