2025-day02 optimised (again)

Author: liamgallear

2025/day02/.bench

@@ -1 +1 @@
-{"Lines":[{"Name":"Part 1","N":50,"NsPerOp":23611500,"AllocedBytesPerOp":0,"AllocsPerOp":0,"MBPerS":0,"Measured":1,"Ord":0},{"Name":"Part 2","N":36,"NsPerOp":30616929,"AllocedBytesPerOp":0,"AllocsPerOp":0,"MBPerS":0,"Measured":1,"Ord":0}],"Measured":1}
+{"Lines":[{"Name":"Part 1","N":49,"NsPerOp":23892882,"AllocedBytesPerOp":0,"AllocsPerOp":0,"MBPerS":0,"Measured":1,"Ord":0},{"Name":"Part 2","N":39,"NsPerOp":31122533,"AllocedBytesPerOp":0,"AllocsPerOp":0,"MBPerS":0,"Measured":1,"Ord":0}],"Measured":1}

2025/day02/part2.go

@@ -16,14 +16,7 @@ func doPartTwo(input string) int {
 			idstring := strconv.Itoa(id)
 			idlen := len(idstring)
 
-			// Single digit always matches
-			if idlen == 1 {
-				ans += id
-				continue
-			}
-
 			// Check if the number can be split into repeating chunks
-			found := false
 			for chunkSize := 1; chunkSize <= idlen/2; chunkSize++ {
 				// Only check divisors of the length
 				if idlen%chunkSize != 0 {
@@ -46,14 +39,9 @@ func doPartTwo(input string) int {
 
 				if match {
 					ans += id
-					found = true
 					break
 				}
 			}
-
-			if found {
-				continue
-			}
 		}
 	}
 	return ans