@@ -0,0 +1,854 @@
+from time import time%0Afrom prime_functions import get_primes_below, is_prime%0A%0AMIL = 1000000%0A%0ALIMIT = MIL%0A%0A%0Adef main():%0A    primes = get_primes_below(LIMIT)%0A%0A    max_sum = 0%0A    max_chain = %5B%5D%0A%0A    slow_idx = 0%0A    fast_idx = slow_idx%0A    while slow_idx %3C len(primes) - 1:%0A        fast_idx += 1%0A%0A        current_chain = primes%5Bslow_idx:fast_idx%5D%0A        current_sum = sum(current_chain)%0A%0A        if current_sum %3E LIMIT or fast_idx == len(primes):%0A            slow_idx += 1%0A            fast_idx = slow_idx%0A            if len(primes%5Bslow_idx:%5D) %3C= len(max_chain):%0A                break%0A%0A        if is_prime(current_sum):%0A            if len(current_chain) %3E len(max_chain):%0A                max_chain = current_chain%0A                max_sum = current_sum%0A%0A    print max_sum%0A%0A%0Aif __name__ == '__main__':%0A    t = time()%0A    main()%0A    print 'Time:', time() - t%0A

Add problem_50, prime chain sum