diff --git a/model/labels/labels.go b/model/labels/labels.go
index 5e06e3b8d..6de001c3c 100644
--- a/model/labels/labels.go
+++ b/model/labels/labels.go
@@ -545,9 +545,12 @@ func (b *Builder) Get(n string) string {
 }
 
 // Range calls f on each label in the Builder.
-// If f calls Set or Del on b then this may affect what callbacks subsequently happen.
 func (b *Builder) Range(f func(l Label)) {
-	origAdd, origDel := b.add, b.del
+	// Stack-based arrays to avoid heap allocation in most cases.
+	var addStack [1024]Label
+	var delStack [1024]string
+	// Take a copy of add and del, so they are unaffected by calls to Set() or Del().
+	origAdd, origDel := append(addStack[:0], b.add...), append(delStack[:0], b.del...)
 	b.base.Range(func(l Label) {
 		if !slices.Contains(origDel, l.Name) && !contains(origAdd, l.Name) {
 			f(l)
diff --git a/model/labels/labels_string.go b/model/labels/labels_string.go
index 6fe14bedc..98db29d25 100644
--- a/model/labels/labels_string.go
+++ b/model/labels/labels_string.go
@@ -599,9 +599,12 @@ func (b *Builder) Get(n string) string {
 }
 
 // Range calls f on each label in the Builder.
-// If f calls Set or Del on b then this may affect what callbacks subsequently happen.
 func (b *Builder) Range(f func(l Label)) {
-	origAdd, origDel := b.add, b.del
+	// Stack-based arrays to avoid heap allocation in most cases.
+	var addStack [1024]Label
+	var delStack [1024]string
+	// Take a copy of add and del, so they are unaffected by calls to Set() or Del().
+	origAdd, origDel := append(addStack[:0], b.add...), append(delStack[:0], b.del...)
 	b.base.Range(func(l Label) {
 		if !slices.Contains(origDel, l.Name) && !contains(origAdd, l.Name) {
 			f(l)