Consider a countable list of files updated according to the move-to-front rule. Files have independent random weights, which are used to construct request probabilities. Exact and asymptotic formulae for the Laplace transform of the stationary search cost are given for i.i.d. weights. Similar expressions are derived for the first two moments. Some results are extended to the case of independent weights.