diff --git a/primitiveCollections/src/main/java/org/lucares/collections/IntList.java b/primitiveCollections/src/main/java/org/lucares/collections/IntList.java
index 767c2cb..8af241a 100644
--- a/primitiveCollections/src/main/java/org/lucares/collections/IntList.java
+++ b/primitiveCollections/src/main/java/org/lucares/collections/IntList.java
@@ -1025,21 +1025,21 @@ public final class IntList implements Serializable, Cloneable {
 
 		while (l < aSize && r < bSize) {
 
-			final int lv = a.get(l);
-			final int rv = b.get(r);
+			final int lv = a.getUnsafe(l);
+			final int rv = b.getUnsafe(r);
 
 			if (lv < rv) {
 				l++;
 			} else if (lv > rv) {
 				r++;
 			} else {
-				result.add(lv);
+				result.addUnsafe(lv);
 				do {
 					l++;
-				} while (l < aSize && lv == a.get(l));
+				} while (l < aSize && lv == a.getUnsafe(l));
 				do {
 					r++;
-				} while (r < bSize && rv == b.get(r));
+				} while (r < bSize && rv == b.getUnsafe(r));
 			}
 		}
 		return result;
@@ -1062,13 +1062,13 @@ public final class IntList implements Serializable, Cloneable {
 			result = new IntList(Math.min(aSize, bSize));
 
 			for (int l = 0; l < aSize; l++) {
-				final int lv = a.get(l);
+				final int lv = a.getUnsafe(l);
 
 				if (b.indexOf(lv) >= 0) {
-					result.add(lv);
+					result.addUnsafe(lv);
 				}
 
-				while (l + 1 < aSize && lv == a.get(l + 1)) {
+				while (l + 1 < aSize && lv == a.getUnsafe(l + 1)) {
 					l++;
 				}
 			}
diff --git a/primitiveCollections/src/main/java/org/lucares/collections/LongList.java b/primitiveCollections/src/main/java/org/lucares/collections/LongList.java
index a7ad2fd..87b2125 100644
--- a/primitiveCollections/src/main/java/org/lucares/collections/LongList.java
+++ b/primitiveCollections/src/main/java/org/lucares/collections/LongList.java
@@ -1024,21 +1024,21 @@ public final class LongList implements Serializable, Cloneable {
 
 		while (l < aSize && r < bSize) {
 
-			final long lv = a.get(l);
-			final long rv = b.get(r);
+			final long lv = a.getUnsafe(l);
+			final long rv = b.getUnsafe(r);
 
 			if (lv < rv) {
 				l++;
 			} else if (lv > rv) {
 				r++;
 			} else {
-				result.add(lv);
+				result.addUnsafe(lv);
 				do {
 					l++;
-				} while (l < aSize && lv == a.get(l));
+				} while (l < aSize && lv == a.getUnsafe(l));
 				do {
 					r++;
-				} while (r < bSize && rv == b.get(r));
+				} while (r < bSize && rv == b.getUnsafe(r));
 			}
 		}
 		return result;
@@ -1061,13 +1061,13 @@ public final class LongList implements Serializable, Cloneable {
 			result = new LongList(Math.min(aSize, bSize));
 
 			for (int l = 0; l < aSize; l++) {
-				final long lv = a.get(l);
+				final long lv = a.getUnsafe(l);
 
 				if (b.indexOf(lv) >= 0) {
-					result.add(lv);
+					result.addUnsafe(lv);
 				}
 
-				while (l + 1 < aSize && lv == a.get(l + 1)) {
+				while (l + 1 < aSize && lv == a.getUnsafe(l + 1)) {
 					l++;
 				}
 			}