Solve day 2 part 2

This is pretty naive but runs in less than a second when compiled.

app/Main.hs

@@ -104,12 +104,21 @@ puzzle2 =
             [ T.show
                 . sum
                 . concatMap
-                    (mapMaybe (\n -> guard (isRepetition n) $> n) . uncurry enumFromTo)
+                    (mapMaybe (\n -> guard (isRepetition2 n) $> n) . uncurry enumFromTo)
+            , T.show
+                . sum
+                . concatMap
+                    (mapMaybe (\n -> guard (isRepetitionN n) $> n) . uncurry enumFromTo)
             ]
         }
 
 newtype ID = ID Int
     deriving newtype (Eq, Ord, Show, Num, Enum)
 
-isRepetition :: ID -> Bool
+isRepetition2 :: ID -> Bool
-isRepetition (T.show -> n) = uncurry (==) $ T.splitAt (T.length n `div` 2) n
+isRepetition2 (T.show -> n) = uncurry (==) $ T.splitAt (T.length n `div` 2) n
+
+isRepetitionN :: ID -> Bool
+isRepetitionN (T.show -> n) = flip any [1 .. T.length n `div` 2] \i -> case T.chunksOf i n of
+    [] -> False
+    x : xs -> all (== x) xs

outputs/examples/2/2

@@ -0,0 +1 @@
+4174379265

outputs/real/2/2

@@ -0,0 +1 @@
+41823587546