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:35Yuriy LyfenkoYuriy LyfenkoScore: 120,015Success
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:35100,254885,978,666822,081,17302,293,760
2Jun 11, 2021 19:35102,770903,170,553842,717,74202,306,048
3Jun 11, 2021 19:35116,0871,023,465,938951,914,30802,306,048
4Jun 11, 2021 19:35117,8821,030,614,204966,631,88602,306,048
5Jun 11, 2021 19:35120,0151,059,964,913984,126,68402,310,144
6Jun 11, 2021 19:35124,9821,089,489,6721,024,849,63502,301,952
7Jun 11, 2021 19:35127,0801,110,651,2601,042,052,56402,314,240
8Jun 11, 2021 19:35129,7721,126,324,2421,064,128,82602,301,952
9Jun 11, 2021 19:35139,2141,200,412,6151,141,553,27302,301,952