diff --git a/exercises/practice/hamming/.approaches/introduction.md b/exercises/practice/hamming/.approaches/introduction.md
index 8ef5c7816..14ed9be2d 100644
--- a/exercises/practice/hamming/.approaches/introduction.md
+++ b/exercises/practice/hamming/.approaches/introduction.md
@@ -127,11 +127,6 @@ For more information, check the [`IntStream` with `reduce()` approach][approach-
 Since benchmarking with the [Java Microbenchmark Harness][jmh] is currently outside the scope of this document,
 the choice between the various approaches can be made by perceived readability.
 
-Of the `IntStream` approaches, the `reduce()` approach likely might be fastest, as it is only one iteration
-instead of an iteration for `filter()` or `map()` and another iteration for `count()` or `sum()`.
-
-The `for` loop may also be fast, but it leaves a mutable member variable for the distance, instead of one marked [`final`][final].
-
 [for]: https://docs.oracle.com/javase/tutorial/java/nutsandbolts/for.html
 [intstream]: https://docs.oracle.com/javase/8/docs/api/java/util/stream/IntStream.html
 [filter]: https://docs.oracle.com/javase/8/docs/api/java/util/stream/IntStream.html#filter-java.util.function.IntPredicate-
@@ -144,4 +139,3 @@ The `for` loop may also be fast, but it leaves a mutable member variable for the
 [approach-intstream-map-sum]:  https://exercism.org/tracks/java/exercises/hamming/approaches/intstream-map-sum
 [approach-intstream-reduce]:  https://exercism.org/tracks/java/exercises/hamming/approaches/intstream-reduce
 [jmh]: https://github.com/openjdk/jmh
-[final]: https://en.wikibooks.org/wiki/Java_Programming/Keywords/final