/prog/ Challenge

Hey, I've stolen this challenge from some website, it's pretty easy but I know most of you will fuck it up.

A sequence is defined by:

n -> n/2 (n is even)
n -> 3n + 1 (n is odd)

Find the longest sequence, with a starting number under one million.

Bonus points when you find the solution for ten million.

>>42
My Java prog is faster than your python one. But still, my optimized python one runs in 6 seconds.

And in C, this is even faster (under one second).