diff --git a/core-java/src/main/java/com/baeldung/numberofdigits/Benchmarking.java b/core-java/src/main/java/com/baeldung/numberofdigits/Benchmarking.java
new file mode 100644
index 0000000000..fbd9af2c30
--- /dev/null
+++ b/core-java/src/main/java/com/baeldung/numberofdigits/Benchmarking.java
@@ -0,0 +1,131 @@
+package com.baeldung.numberofdigits;
+
+import static com.baeldung.designpatterns.util.LogerUtil.LOG;;
+
+public class Benchmarking {;
+
+    private static final int LOWER_BOUND = 1;
+    private static final int UPPER_BOUND = 999999999;
+
+    
+    public static void main(String[] args) {
+        LOG.info("Testing all methods...");
+        
+        long length = test_stringBasedSolution();
+        LOG.info("String Based Solution : " + length);
+        
+        length = test_logarithmicApproach();
+        LOG.info("Logarithmic Approach : " + length);
+        
+        length = test_repeatedMultiplication();
+        LOG.info("Repeated Multiplication : " + length);
+        
+        length = test_shiftOperators();
+        LOG.info("Shift Operators : " + length);
+        
+        length = test_dividingWithPowersOf2();
+        LOG.info("Dividing with Powers of 2 : " + length);
+        
+        length = test_divideAndConquer();
+        LOG.info("Divide And Conquer : " + length);
+
+    }
+
+    private static long test_stringBasedSolution() {
+        
+        long startTime, stopTime, elapsedTime;
+        startTime = System.currentTimeMillis();
+
+        int total = 0;
+        for (int i = LOWER_BOUND; i <= UPPER_BOUND; i++) {
+            total += NumberOfDigits.stringBasedSolution(i);
+        }
+
+        stopTime = System.currentTimeMillis();
+        elapsedTime = stopTime - startTime;
+        
+        return elapsedTime;
+    }
+
+    private static long test_logarithmicApproach() {
+        
+        long startTime, stopTime, elapsedTime;
+        startTime = System.currentTimeMillis();
+
+        int total = 0;
+        for (int i = LOWER_BOUND; i <= UPPER_BOUND; i++) {
+            total += NumberOfDigits.logarithmicApproach(i);
+        }
+
+        stopTime = System.currentTimeMillis();
+        elapsedTime = stopTime - startTime;
+        
+        return elapsedTime;
+    }
+
+    private static long test_repeatedMultiplication() {
+        
+        long startTime, stopTime, elapsedTime;
+        startTime = System.currentTimeMillis();
+
+        int total = 0;
+        for (int i = LOWER_BOUND; i <= UPPER_BOUND; i++) {
+            total += NumberOfDigits.repeatedMultiplication(i);
+        }
+
+        stopTime = System.currentTimeMillis();
+        elapsedTime = stopTime - startTime;
+        
+        return elapsedTime;
+    }
+
+    private static long test_shiftOperators() {
+        
+        long startTime, stopTime, elapsedTime;
+        startTime = System.currentTimeMillis();
+
+        int total = 0;
+        for (int i = LOWER_BOUND; i <= UPPER_BOUND; i++) {
+            total += NumberOfDigits.shiftOperators(i);
+        }
+
+        stopTime = System.currentTimeMillis();
+        elapsedTime = stopTime - startTime;
+        
+        return elapsedTime;
+    }
+
+    private static long test_dividingWithPowersOf2() {
+        
+        long startTime, stopTime, elapsedTime;
+        startTime = System.currentTimeMillis();
+
+        int total = 0;
+        for (int i = LOWER_BOUND; i <= UPPER_BOUND; i++) {
+            total += NumberOfDigits.dividingWithPowersOf2(i);
+        }
+
+        stopTime = System.currentTimeMillis();
+        elapsedTime = stopTime - startTime;
+        
+        return elapsedTime;
+    }
+
+    private static long test_divideAndConquer() {
+        
+        long startTime, stopTime, elapsedTime;
+        startTime = System.currentTimeMillis();
+
+        int total = 0;
+        for (int i = LOWER_BOUND; i <= UPPER_BOUND; i++) {
+            total += NumberOfDigits.divideAndConquer(i);
+        }
+
+        stopTime = System.currentTimeMillis();
+        elapsedTime = stopTime - startTime;
+        
+        return elapsedTime;
+    }
+    
+    
+}
diff --git a/core-java/src/main/java/com/baeldung/numberofdigits/NumberOfDigits.java b/core-java/src/main/java/com/baeldung/numberofdigits/NumberOfDigits.java
new file mode 100644
index 0000000000..f455430750
--- /dev/null
+++ b/core-java/src/main/java/com/baeldung/numberofdigits/NumberOfDigits.java
@@ -0,0 +1,97 @@
+package com.baeldung.numberofdigits;
+
+public class NumberOfDigits {
+    public static int stringBasedSolution(int number) {
+        int length = String.valueOf(number).length();
+        return length;
+    }
+    
+    public static int logarithmicApproach(int number) {
+        int length = (int) Math.log10(number) + 1;
+        return length;
+    }
+    
+    public static int repeatedMultiplication(int number) {
+        int length = 0;
+        long temp = 1;
+        while(temp <= number) {
+            length++;
+            temp *= 10;
+        }
+        return length;
+    }
+
+    public static int shiftOperators(int number) {
+        int length = 0;
+        long temp = 1;
+        while(temp <= number) {
+            length++;
+            temp = (temp << 3) + (temp << 1);
+        }
+        return length;
+    }
+    
+    public static int dividingWithPowersOf2(int number) {
+        int length = 1;
+        if (number >= 100000000) {
+            length += 8;
+            number /= 100000000;
+        }
+        if (number >= 10000) {
+            length += 4;
+            number /= 10000;
+        }
+        if (number >= 100) {
+            length += 2;
+            number /= 100;
+        }
+        if (number >= 10) {
+            length += 1;
+        }
+        return length;
+    }
+    
+    public static int divideAndConquer(int number) {
+        if (number < 100000){
+            // 5 digits or less
+            if (number < 100){
+                // 1 or 2
+                if (number < 10)
+                    return 1;
+                else
+                    return 2;
+            }else{
+                // 3 to 5 digits
+                if (number < 1000)
+                    return 3;
+                else{
+                    // 4 or 5 digits
+                    if (number < 10000)
+                        return 4;
+                    else
+                        return 5;
+                }
+            }
+        } else {
+            // 6 digits or more
+            if (number < 10000000) {
+                // 6 or 7 digits
+                if (number < 1000000)
+                    return 6;
+                else
+                    return 7;
+            } else {
+                // 8 to 10 digits
+                if (number < 100000000)
+                    return 8;
+                else {
+                    // 9 or 10 digits
+                    if (number < 1000000000)
+                        return 9;
+                    else
+                        return 10;
+                }
+            }
+        }
+    }
+}
diff --git a/core-java/src/main/java/com/baeldung/numberofdigits/NumberOfDigitsDriver.java b/core-java/src/main/java/com/baeldung/numberofdigits/NumberOfDigitsDriver.java
new file mode 100644
index 0000000000..4d76a5d677
--- /dev/null
+++ b/core-java/src/main/java/com/baeldung/numberofdigits/NumberOfDigitsDriver.java
@@ -0,0 +1,27 @@
+package com.baeldung.numberofdigits;
+
+import static com.baeldung.designpatterns.util.LogerUtil.LOG;
+
+public class NumberOfDigitsDriver {
+    public static void main(String[] args) {
+        LOG.info("Testing all methods...");
+        
+        long length = NumberOfDigits.stringBasedSolution(602);
+        LOG.info("String Based Solution : " + length);
+        
+        length = NumberOfDigits.logarithmicApproach(602);
+        LOG.info("Logarithmic Approach : " + length);
+        
+        length = NumberOfDigits.repeatedMultiplication(602);
+        LOG.info("Repeated Multiplication : " + length);
+        
+        length = NumberOfDigits.shiftOperators(602);
+        LOG.info("Shift Operators : " + length);
+        
+        length = NumberOfDigits.dividingWithPowersOf2(602);
+        LOG.info("Dividing with Powers of 2 : " + length);
+        
+        length = NumberOfDigits.divideAndConquer(602);
+        LOG.info("Divide And Conquer : " + length);
+    }
+}
diff --git a/core-java/src/test/java/com/baeldung/numberofdigits/NumberOfDigitsIntegrationTest.java b/core-java/src/test/java/com/baeldung/numberofdigits/NumberOfDigitsIntegrationTest.java
new file mode 100644
index 0000000000..01b874622e
--- /dev/null
+++ b/core-java/src/test/java/com/baeldung/numberofdigits/NumberOfDigitsIntegrationTest.java
@@ -0,0 +1,100 @@
+package com.baeldung.numberofdigits;
+
+import org.junit.Assert;
+import org.junit.Assume;
+import org.junit.experimental.theories.DataPoints;
+import org.junit.experimental.theories.Theories;
+import org.junit.experimental.theories.Theory;
+import org.junit.runner.RunWith;
+
+@RunWith(Theories.class)
+public class NumberOfDigitsIntegrationTest {
+
+    @DataPoints
+    public static int[][] lowestIntegers()
+    {
+      return new int[][]{
+          {1, 1}, 
+          {2, 10}, 
+          {3, 100}, 
+          {4, 1000}, 
+          {5, 10000}, 
+          {6, 100000}, 
+          {7, 1000000}, 
+          {8, 10000000}, 
+          {9, 100000000}, 
+          {10, 1000000000}
+      };
+    }
+    
+    @DataPoints
+    public static int[][] highestIntegers()
+    {
+      return new int[][]{
+          {1, 9}, 
+          {2, 99}, 
+          {3, 999}, 
+          {4, 9999}, 
+          {5, 99999}, 
+          {6, 999999}, 
+          {7, 9999999}, 
+          {8, 99999999}, 
+          {9, 999999999}, 
+          {10, Integer.MAX_VALUE}
+      };
+    }
+    
+    @DataPoints
+    public static int[][] randomIntegers()
+    {
+      return new int[][]{
+          {1, 1}, 
+          {2, 14}, 
+          {3, 549}, 
+          {4, 1136}, 
+          {5, 25340}, 
+          {6, 134321}, 
+          {7, 1435432}, 
+          {8, 54234129}, 
+          {9, 113683912}, 
+          {10, 1534031982}
+      };
+    }
+
+    @Theory
+    public void givenDataPoints_whenStringBasedSolutionInvoked_thenAllPointsMatch(final int[] entry) {
+        Assume.assumeTrue(entry[0] > 0 && entry[1] > 0);
+        Assert.assertEquals(entry[0], NumberOfDigits.stringBasedSolution(entry[1]));
+    }
+
+    @Theory
+    public void givenDataPoints_whenLogarithmicApproachInvoked_thenAllPointsMatch(final int[] entry) {
+        Assume.assumeTrue(entry[0] > 0 && entry[1] > 0);
+        Assert.assertEquals(entry[0], NumberOfDigits.logarithmicApproach(entry[1]));
+    }
+
+    @Theory
+    public void givenDataPoints_whenRepeatedMultiplicationInvoked_thenAllPointsMatch(final int[] entry) {
+        Assume.assumeTrue(entry[0] > 0 && entry[1] > 0);
+        Assert.assertEquals(entry[0], NumberOfDigits.repeatedMultiplication(entry[1]));
+    }
+
+    @Theory
+    public void givenDataPoints_whenShiftOperatorsInvoked_thenAllPointsMatch(final int[] entry) {
+        Assume.assumeTrue(entry[0] > 0 && entry[1] > 0);
+        Assert.assertEquals(entry[0], NumberOfDigits.shiftOperators(entry[1]));
+    }
+
+    @Theory
+    public void givenDataPoints_whenDividingWithPowersOf2Invoked_thenAllPointsMatch(final int[] entry) {
+        Assume.assumeTrue(entry[0] > 0 && entry[1] > 0);
+        Assert.assertEquals(entry[0], NumberOfDigits.dividingWithPowersOf2(entry[1]));
+    }
+
+    @Theory
+    public void givenDataPoints_whenDivideAndConquerInvoked_thenAllPointsMatch(final int[] entry) {
+        Assume.assumeTrue(entry[0] > 0 && entry[1] > 0);
+        Assert.assertEquals(entry[0], NumberOfDigits.divideAndConquer(entry[1]));
+    }
+    
+}
\ No newline at end of file