Euler Problem 8 solution

Time (s): ~0.001

package margusmartseppcode.From_1_to_9;

public class Problem_8 {
 public static void main(String[] args) {
  char[] nr = ("7316717653133062491922511967442657474235534919493"
    + "496983520312774506326239578318016984801869478851843"
    + "858615607891129494954595017379583319528532088055111"
    + "254069874715852386305071569329096329522744304355766"
    + "896648950445244523161731856403098711121722383113622"
    + "298934233803081353362766142828064444866452387493035"
    + "890729629049156044077239071381051585930796086670172"
    + "427121883998797908792274921901699720888093776657273"
    + "330010533678812202354218097512545405947522435258490"
    + "771167055601360483958644670632441572215539753697817"
    + "977846174064955149290862569321978468622482839722413"
    + "756570560574902614079729686524145351004748216637048"
    + "440319989000889524345065854122758866688116427171479"
    + "924442928230863465674813919123162824586178664583591"
    + "245665294765456828489128831426076900422421902267105"
    + "562632111110937054421750694165896040807198403850962"
    + "455444362981230987879927244284909188845801561660979"
    + "191338754992005240636899125607176060588611646710940"
    + "507754100225698315520005593572972571636269561882670"
    + "428252483600823257530420752963450").toCharArray();
  int tmp = 0, max = 0;

  for (int i = 4; i < nr.length; i++, tmp = 1) {
   for (int j = -4; j <= 0; j++)
    tmp *= (nr[i + j] - '0');

   if (tmp > max)
    max = tmp;
  }
  System.out.println(max);
 }
}