Thread: help

I'm going through a question on project euler and feel I have the solution though get a wrong answer when submitted, I've tried different methods and smaller versions of the question and still get the same answers which seem totally right, question seems pretty clear. I'm just wondering if someone could read my code and tell me if I'm wrong and some small tips.
here is the question:
Problem 8 - Project Euler

import java.util.LinkedList;
 
public class justTrying{
	public static void main(String[]args){
 
 Integer[] stuff = {};
   String sum1 = "7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450";
	LinkedList<Integer>li = new LinkedList<Integer>();
 
   for(int i = 0;i<sum1.length();i++){
	   int n = Integer.parseInt(sum1.substring(i, i+1));
	   li.add(n);
	   }
   stuff = li.toArray(new Integer[li.size()]);
   for(int j = 0;j<stuff.length-5;j = j+5){
	   System.out.println(stuff[j]*stuff[j+1]*stuff[j+2]*stuff[j+3]*stuff[j+4]);
   }
		}
	}

From here look at the answers for the highest.

--- Update ---

I don't want the answer if I'm wrong.
The Number is right since I've checked it.

another careless mistake, finally solved it, thanks anyway guys.