diff --git a/RedBlackTree.zig b/RedBlackTree.zig
index 428d790..4185818 100644
--- a/RedBlackTree.zig
+++ b/RedBlackTree.zig
@@ -808,7 +808,7 @@ const TestNode = struct {
 test "insert, search, inorder, remove" {
     var tree = RedBlackTree{};
     try std.testing.expect(tree.isEmpty());
-    const count = 1000;
+    const count = 1000000;
 
     var reference = try std.ArrayListUnmanaged(TestNode).initCapacity(std.testing.allocator, count);
     defer reference.deinit(std.testing.allocator);
@@ -827,6 +827,7 @@ test "insert, search, inorder, remove" {
         std.log.debug("Inserting: {}", .{item.val});
         tree.insert(&item.node, {}, testCompareNodes);
 
+        if (i % (count / 10) != 0) continue;
         var iter = tree.inorder();
         var j: u64 = 0;
         var prev: u32 = 0;
@@ -851,6 +852,7 @@ test "insert, search, inorder, remove" {
         try std.testing.expect(node_opt != null);
         tree.remove(node_opt.?);
 
+        if (i % (count / 10) != 0) continue;
         var iter = tree.inorder();
         var j: u64 = 0;
         var prev: u32 = 0;
diff --git a/generic_red_black_tree.zig b/generic_red_black_tree.zig
index 087236b..5aa7f67 100644
--- a/generic_red_black_tree.zig
+++ b/generic_red_black_tree.zig
@@ -758,7 +758,7 @@ const TestNode = TestTree.Node;
 test "insert, search, inorder, remove" {
     var tree = TestTree{};
     try std.testing.expect(tree.isEmpty());
-    const count = 1000;
+    const count = 1000000;
 
     var reference = try std.ArrayListUnmanaged(TestNode).initCapacity(std.testing.allocator, count);
     defer reference.deinit(std.testing.allocator);
@@ -777,6 +777,7 @@ test "insert, search, inorder, remove" {
         std.log.debug("Inserting: {}", .{item.payload});
         tree.insert(item);
 
+        if (i % (count / 10) != 0) continue;
         var iter = tree.inorder();
         var j: u64 = 0;
         var prev: TestInt = 0;
@@ -800,6 +801,7 @@ test "insert, search, inorder, remove" {
         try std.testing.expect(node_opt != null);
         tree.remove(node_opt.?);
 
+        if (i % (count / 10) != 0) continue;
         var iter = tree.inorder();
         var j: u64 = 0;
         var prev: TestInt = 0;