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 14:41Yuriy LyfenkoYuriy LyfenkoError
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 14:1000000Error: died or killed
2Jun 12, 2021 14:1000000Error: expected "2147976946 ", got "4294475461 "stderr
3Jun 12, 2021 14:41104,352915,874,437855,688,03102,293,760
4Jun 12, 2021 14:44107,186954,819,700878,928,74202,301,952
5Jun 12, 2021 14:17108,257945,579,548887,705,11902,310,144
6Jun 12, 2021 14:44118,0521,039,115,240968,023,84002,297,856
7Jun 12, 2021 14:44118,6881,034,041,334973,240,58602,310,144
8Jun 12, 2021 14:17121,0131,063,280,311992,309,19302,293,760
9Jun 12, 2021 14:41126,0061,098,477,1771,033,252,88102,301,952
10Jun 12, 2021 14:41126,5321,091,829,9421,037,562,29502,310,144
11Jun 12, 2021 14:17140,4421,208,196,7991,151,626,52602,301,952