Euler Problem #7 - 10001st prime number (much (20x!) faster - now break when primes > sqrt prime candidate)

gistfile1.rb

primes = [2]
count = 1
prime_candidate = 2
start = Time.now()
until (count == 10001) do
  prime_candidate +=1
  while (true) do
    psqrt = Math.sqrt(prime_candidate)
    unless primes.
	find do |prime|
		break if prime > psqrt
		prime_candidate % prime == 0
	end
      break;
    end
    prime_candidate +=1
  end
  primes << prime_candidate
  count +=1
end
puts prime_candidate
elapsed = start - Time.now()
puts elapsed.to_s