diff --git a/src/main/java/mattrixwv/ProjectEuler/Problems/Problem18.java b/src/main/java/mattrixwv/ProjectEuler/Problems/Problem18.java
index e4e1d27..b9f8ba9 100644
--- a/src/main/java/mattrixwv/ProjectEuler/Problems/Problem18.java
+++ b/src/main/java/mattrixwv/ProjectEuler/Problems/Problem18.java
@@ -234,5 +234,5 @@ public class Problem18 extends Problem{
 
 /* Results:
 The value of the longest path is 1074
-It took an average of 252.472 microseconds to run this problem through 100 iterations
+It took an average of 198.418 microseconds to run this problem through 100 iterations
 */
diff --git a/src/main/java/mattrixwv/ProjectEuler/Problems/Problem67.java b/src/main/java/mattrixwv/ProjectEuler/Problems/Problem67.java
index 1c7ff2c..0a36229 100644
--- a/src/main/java/mattrixwv/ProjectEuler/Problems/Problem67.java
+++ b/src/main/java/mattrixwv/ProjectEuler/Problems/Problem67.java
@@ -352,10 +352,9 @@ public class Problem67 extends Problem{
 		//Stop the timer
 		timer.stop();
 
-		//Print the results
 		//Get the correct total which will be the inversion of the current one
 		int actualTotal = ((100 * NUM_ROWS) - foundPoints.get(foundPoints.size() - 1).total);
-
+		//Save the results
 		result = "The value of the longest path is " + actualTotal;
 
 		//Throw a flag to show the problem is solved
@@ -411,5 +410,5 @@ public class Problem67 extends Problem{
 
 /* Results:
 The value of the longest path is 7273
-It took an average of 182.482 milliseconds to run this problem through 100 iterations
+It took an average of 187.077 milliseconds to run this problem through 100 iterations
 */