title: Number Digits Product Two Numbers
signature: numberDigitsProductTwoNumbers :: Integer -> Integer -> Integer
  numberDigitsProductTwoNumbers a b = 
test_code: import Text.Printf
  import Control.Exception (catch, SomeException)
  import Data.Typeable
  import qualified Data.List as List
  import qualified Data.Map as Map
  import qualified Data.Set as Set
  
  -- SOLUTION CODE
  -- ============================================
  
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  validateSolution :: Integer -> Integer -> Bool
  validateSolution actual expected = do
      actual == expected
  
  
  driver :: Integer -> Integer -> Integer -> String
  driver a b expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME a b) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      printf "TEST-0...%s\n" (driver (86) (39) (4) )
  
      printf "TEST-1...%s\n" (driver (81) (87) (4) )
  
      printf "TEST-2...%s\n" (driver (48) (84) (4) )
  
      printf "TEST-3...%s\n" (driver (64) (80) (4) )
  
      printf "TEST-4...%s\n" (driver (56) (20) (4) )
  
      printf "TEST-5...%s\n" (driver (5) (70) (3) )
  
      printf "TEST-6...%s\n" (driver (25) (13) (3) )
  
      printf "TEST-7...%s\n" (driver (94) (83) (4) )
  
      printf "TEST-8...%s\n" (driver (5) (55) (3) )
  
      printf "TEST-9...%s\n" (driver (46) (46) (4) )
  
source_py: def number_digits_product_two_numbers(a, b):
      count = 0
      p = abs((a * b))
      if (p == 0):
          return 1
      while (p > 0):
          count = (count + 1)
          p = (p // 10)
      return count
source_cpp: int number_digits_product_two_numbers(int a, int b) {
    int count = 0;
    int p = abs ( a * b );
    if ( p == 0 ) return 1;
    while ( p > 0 ) {
      count ++;
      p = p / 10;
    }
    return count;
  }