diff --git a/milli/src/search/facet/facet_distribution.rs b/milli/src/search/facet/facet_distribution.rs
index 23b0b1df9..7340538ea 100644
--- a/milli/src/search/facet/facet_distribution.rs
+++ b/milli/src/search/facet/facet_distribution.rs
@@ -1,6 +1,6 @@
 use std::collections::{BTreeMap, HashSet};
 use std::ops::Bound::Unbounded;
-use std::{cmp, fmt, mem};
+use std::{fmt, mem};
 
 use heed::types::ByteSlice;
 use roaring::RoaringBitmap;
@@ -17,10 +17,6 @@ use crate::{FieldId, Index, Result};
 /// be fetched from the key-value store.
 const DEFAULT_VALUES_BY_FACET: usize = 1000;
 
-/// The hard limit in the number of values by facets that will be fetched from
-/// the key-value store. Searching for more values could slow down the engine.
-const MAX_VALUES_BY_FACET: usize = 10000;
-
 /// Threshold on the number of candidates that will make
 /// the system to choose between one algorithm or another.
 const CANDIDATES_THRESHOLD: u64 = 3000;
@@ -50,7 +46,7 @@ impl<'a> FacetDistribution<'a> {
     }
 
     pub fn max_values_by_facet(&mut self, max: usize) -> &mut Self {
-        self.max_values_by_facet = cmp::min(max, MAX_VALUES_BY_FACET);
+        self.max_values_by_facet = max;
         self
     }