SPOJ Factorial solution in Java

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;

public class FCTRL {


    public static class InputReader {
        private BufferedReader reader;
        private StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream));
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }
    }

    public static void main(String[] args) {
        InputReader in = new InputReader(System.in);

        List<Integer> fiveMultiples = new ArrayList<Integer>();
        for (int i = 1; i < 100; i++) {
            if (Math.pow(5, i) > 1000000000) break;
            fiveMultiples.add((int) Math.pow(5, i));
        }

        int T = in.nextInt();
        while (T-- != 0) {
            int num = in.nextInt();
            int count = 0;
            for (int x : fiveMultiples) {
                if (x > num) break;
                count += num / x;
            }
            System.out.println(count);
        }
    }
}

Sample Input:

6
3
60
100
1024
23456
8735373

Sample Output:

0
14
24
253
5861
2183837