title: Count Set Bits In An Integer
signature: countSetBitsInAnInteger :: Integer -> Integer
  countSetBitsInAnInteger n = 
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 -> String
  driver n expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME n) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      printf "TEST-0...%s\n" (driver (58) (4) )
  
      printf "TEST-1...%s\n" (driver (92) (4) )
  
      printf "TEST-2...%s\n" (driver (73) (3) )
  
      printf "TEST-3...%s\n" (driver (52) (3) )
  
      printf "TEST-4...%s\n" (driver (24) (2) )
  
      printf "TEST-5...%s\n" (driver (14) (3) )
  
      printf "TEST-6...%s\n" (driver (58) (4) )
  
      printf "TEST-7...%s\n" (driver (11) (3) )
  
      printf "TEST-8...%s\n" (driver (8) (1) )
  
      printf "TEST-9...%s\n" (driver (52) (3) )
  
source_py: def count_set_bits_in_an_integer(n):
      count = 0
      while n:
          count += (n & 1)
          n >>= 1
      return count
source_cpp: unsigned int count_set_bits_in_an_integer(unsigned int n) {
    unsigned int count = 0;
    while ( n ) {
      count += n & 1;
      n >>= 1;
    }
    return count;
  }