diff --git a/velox/exec/VectorHasher.cpp b/velox/exec/VectorHasher.cpp
index 1d439b3b583..496d23bd092 100644
--- a/velox/exec/VectorHasher.cpp
+++ b/velox/exec/VectorHasher.cpp
@@ -664,6 +664,17 @@ void VectorHasher::analyzeValue(int128_t value) {
   }
 }
 
+void VectorHasher::analyzeValue(Timestamp value) {
+  if (FOLLY_UNLIKELY(
+          value.getNanos() % Timestamp::kNanosecondsInMillisecond != 0)) {
+    setRangeOverflow();
+    setDistinctOverflow();
+    return;
+  }
+
+  analyzeValue(value.toMillis());
+}
+
 template <>
 void VectorHasher::analyzeValue(StringView value) {
   int size = value.size();
diff --git a/velox/exec/VectorHasher.h b/velox/exec/VectorHasher.h
index cee4faf801a..58d52d94443 100644
--- a/velox/exec/VectorHasher.h
+++ b/velox/exec/VectorHasher.h
@@ -362,6 +362,9 @@ class VectorHasher {
 
   // true if no values have been added.
   bool empty() const {
+    if (typeSupportsValueIds() && distinctOverflow_) {
+      return false;
+    }
     const bool hasSeenValue =
         typeKind_ == TypeKind::HUGEINT ? hasHugeintValue_ : hasRange_;
     return !hasSeenValue && numDistinct() == 0;
@@ -513,12 +516,24 @@ class VectorHasher {
 
   void analyzeValue(int128_t value);
 
+  void analyzeValue(Timestamp value);
+
   template <typename T>
   bool tryMapToRangeSimd(
       const T* values,
       const SelectivityVector& rows,
       uint64_t* result);
 
+  bool
+  tryMapInt64ToRange(int64_t int64Value, vector_size_t row, uint64_t* result) {
+    if (int64Value > max_ || int64Value < min_) {
+      return false;
+    }
+    const auto hash = int64Value - min_ + 1;
+    result[row] = multiplier_ == 1 ? hash : result[row] + multiplier_ * hash;
+    return true;
+  }
+
   template <typename T>
   bool tryMapToRange(
       const T* values,
@@ -541,14 +556,10 @@ class VectorHasher {
 
       bool inRange = true;
       rows.testSelected([&](vector_size_t row) {
-        auto int64Value = toInt64(values[row]);
-        if (int64Value > max_ || int64Value < min_) {
+        if (!tryMapInt64ToRange(toInt64(values[row]), row, result)) {
           inRange = false;
           return false;
         }
-        auto hash = int64Value - min_ + 1;
-        result[row] =
-            multiplier_ == 1 ? hash : result[row] + multiplier_ * hash;
         return true;
       });
 
@@ -762,7 +773,7 @@ inline uint64_t VectorHasher::lookupValueId(StringView value) const {
 
 template <>
 inline uint64_t VectorHasher::lookupValueId(Timestamp timestamp) const {
-  return timestamp.getNanos() % 1'000'000 != 0
+  return timestamp.getNanos() % Timestamp::kNanosecondsInMillisecond != 0
       ? kUnmappable
       : lookupValueId(timestamp.toMillis());
 }
@@ -784,6 +795,35 @@ inline uint64_t VectorHasher::valueId(Timestamp value) {
   return valueId(value.toMillis());
 }
 
+template <>
+inline bool VectorHasher::tryMapToRange(
+    const Timestamp* values,
+    const SelectivityVector& rows,
+    uint64_t* result) {
+  VELOX_DCHECK(isRange_);
+  if (!isRange_) {
+    return false;
+  }
+
+  bool inRange = true;
+  rows.testSelected([&](vector_size_t row) {
+    const auto value = values[row];
+    if (FOLLY_UNLIKELY(
+            value.getNanos() % Timestamp::kNanosecondsInMillisecond != 0)) {
+      inRange = false;
+      return false;
+    }
+
+    if (!tryMapInt64ToRange(value.toMillis(), row, result)) {
+      inRange = false;
+      return false;
+    }
+    return true;
+  });
+
+  return inRange;
+}
+
 template <>
 inline bool VectorHasher::tryMapToRange(
     const bool* values,
diff --git a/velox/exec/tests/VectorHasherTest.cpp b/velox/exec/tests/VectorHasherTest.cpp
index abf0a7fd774..40c309b2ec8 100644
--- a/velox/exec/tests/VectorHasherTest.cpp
+++ b/velox/exec/tests/VectorHasherTest.cpp
@@ -1031,6 +1031,100 @@ TEST_F(VectorHasherTest, int128BoundaryCollisionsForRows) {
   }
 }
 
+TEST_F(VectorHasherTest, timestampRangePrecision) {
+  auto millisecondsVector = makeFlatVector<Timestamp>(
+      {Timestamp::fromMillis(1), Timestamp::fromMillis(2)});
+  SelectivityVector rows(millisecondsVector->size());
+  raw_vector<uint64_t> result(millisecondsVector->size());
+
+  auto hasher = exec::VectorHasher::create(TIMESTAMP(), 0);
+  hasher->decode(*millisecondsVector, rows);
+  ASSERT_FALSE(hasher->computeValueIds(rows, result));
+
+  uint64_t asRange;
+  uint64_t asDistinct;
+  hasher->cardinality(0, asRange, asDistinct);
+  ASSERT_EQ(3, asRange);
+  ASSERT_EQ(3, asDistinct);
+
+  ASSERT_EQ(3, hasher->enableValueRange(1, 0));
+
+  hasher->decode(*millisecondsVector, rows);
+  ASSERT_TRUE(hasher->computeValueIds(rows, result));
+
+  // Timestamp in range value-id mode must not map sub-millisecond values by
+  // truncating them with toMillis().
+  auto subMillisecondVector =
+      makeFlatVector<Timestamp>({Timestamp::fromMicros(1'001)});
+  SelectivityVector subMillisecondRows(subMillisecondVector->size());
+  result.resize(subMillisecondVector->size());
+  std::fill(result.begin(), result.end(), 0);
+
+  hasher->decode(*subMillisecondVector, subMillisecondRows);
+  EXPECT_FALSE(hasher->computeValueIds(subMillisecondRows, result));
+  EXPECT_FALSE(hasher->mayUseValueIds());
+}
+
+TEST_F(VectorHasherTest, timestampAnalyzePrecision) {
+  constexpr int32_t kValueOffset = 0;
+  constexpr int32_t kNullByte = sizeof(Timestamp);
+  constexpr int32_t kRowSize = sizeof(Timestamp) + 1;
+  constexpr uint8_t kNullMask = 1;
+
+  alignas(Timestamp) std::array<char, kRowSize> rowData;
+  rowData.fill(0);
+  std::vector<char*> groups{rowData.data()};
+
+  auto timestamp = Timestamp::fromMicros(1'001);
+  memcpy(groups[0] + kValueOffset, &timestamp, sizeof(Timestamp));
+
+  // Row-wise analyze must not collect range or distinct stats by truncating
+  // sub-millisecond timestamps with toMillis().
+  auto rowHasher = exec::VectorHasher::create(TIMESTAMP(), 0);
+  rowHasher->analyze(groups.data(), 1, kValueOffset, kNullByte, kNullMask);
+
+  uint64_t asRange;
+  uint64_t asDistinct;
+  rowHasher->cardinality(0, asRange, asDistinct);
+  EXPECT_EQ(VectorHasher::kRangeTooLarge, asRange);
+  EXPECT_EQ(VectorHasher::kRangeTooLarge, asDistinct);
+  EXPECT_FALSE(rowHasher->mayUseValueIds());
+}
+
+TEST_F(VectorHasherTest, timestampMergeOverflow) {
+  auto subMillisecondVector =
+      makeFlatVector<Timestamp>({Timestamp::fromMicros(1'001)});
+  SelectivityVector subMillisecondRows(subMillisecondVector->size());
+  raw_vector<uint64_t> result(subMillisecondVector->size());
+
+  VectorHasher subMillisecondHasher(TIMESTAMP(), 0);
+  subMillisecondHasher.decode(*subMillisecondVector, subMillisecondRows);
+  ASSERT_FALSE(
+      subMillisecondHasher.computeValueIds(subMillisecondRows, result));
+  ASSERT_FALSE(subMillisecondHasher.mayUseValueIds());
+
+  // Precision overflow is not an empty state and must be propagated through
+  // merge().
+  auto millisecondsVector =
+      makeFlatVector<Timestamp>({Timestamp::fromMillis(1)});
+  SelectivityVector millisecondRows(millisecondsVector->size());
+  result.resize(millisecondsVector->size());
+
+  VectorHasher millisecondHasher(TIMESTAMP(), 0);
+  millisecondHasher.decode(*millisecondsVector, millisecondRows);
+  ASSERT_FALSE(millisecondHasher.computeValueIds(millisecondRows, result));
+  ASSERT_TRUE(millisecondHasher.mayUseValueIds());
+
+  millisecondHasher.merge(subMillisecondHasher, VectorHasher::kMaxDistinct);
+
+  uint64_t asRange;
+  uint64_t asDistinct;
+  millisecondHasher.cardinality(0, asRange, asDistinct);
+  EXPECT_EQ(VectorHasher::kRangeTooLarge, asRange);
+  EXPECT_EQ(VectorHasher::kRangeTooLarge, asDistinct);
+  EXPECT_FALSE(millisecondHasher.mayUseValueIds());
+}
+
 TEST_F(VectorHasherTest, computeValueIdsInteger) {
   testComputeValueIds<int32_t>(false);
   testComputeValueIds<int32_t>(true);