Euler20

import java.math.BigInteger;

public class ProblemTwenty {

    public static void main(String[] args) {
        // TODO Auto-generated method stub

        int totalSum = 0;
        BigInteger factorialSum = new BigInteger("1");

        for (int j = 100; j > 0; j--) {
            factorialSum = factorialSum.multiply(BigInteger.valueOf(j));
        }
        String sumConversion = factorialSum.toString();
        String[] indivNumbers = sumConversion.split("");

        int[] results = new int[sumConversion.length()];

        for (int k = 0; k < sumConversion.length(); k++) {
            try {
                results[k] = Integer.parseInt(indivNumbers[k]);
            } catch (NumberFormatException nfe) {
                System.out.println("Something went wrong...");
            }
            ;
        }

        for (int i = 0; i < results.length; i++) {
            totalSum += results[i];
        }

        System.out.println(totalSum);
    }

}