Euler Problem 16 solution

Time (s): ~0.003

package margusmartseppcode.From_10_to_19;

import java.math.BigInteger;

public class Problem_16 {

 public static void main(String[] args) {
  int sum = 0;
  for (char c : BigInteger.valueOf(2L).pow(1000).toString().toCharArray())
   sum += c - '0';
  System.out.println(sum);
 }
}