diff --git a/performance/ring/src/main/kotlin/org/jetbrains/ring/EulerBenchmark.kt b/performance/ring/src/main/kotlin/org/jetbrains/ring/EulerBenchmark.kt
index b25c2d0600b..70b43d6dfc8 100644
--- a/performance/ring/src/main/kotlin/org/jetbrains/ring/EulerBenchmark.kt
+++ b/performance/ring/src/main/kotlin/org/jetbrains/ring/EulerBenchmark.kt
@@ -70,10 +70,6 @@ open class EulerBenchmark {
             for (j in minDiv..maxDiv) {
                 if (i % j == 0L) {
                     val res = i / j
-                    // Without toLong() here we have a real nightmare...
-                    // in is resolved to Iterable<Int>.contains(Long)
-                    // which has O(N) complexity and always gives false
-                    // See KT-6978, KT-6950, KT-6361
                     if (res in minDiv.toLong()..maxDiv.toLong()) {
                         return i
                     }