I have solved problem 2 of Project Euler using java. I created a google code hosted project here where you can check out the solutions to the problems I have solved. In particular the solution to problem 2 is here
What I used for solving the problem was a procedural implementation of the fibonacci series. If you program in java you always have to remember that primitives are faster than Number objects. BTW the solutions is a brute force approach, but it runs pretty fast in Java.