<jupyter_start><jupyter_text>*This problem is taken from projecteuler.net<jupyter_code>""""
Largest product in a series 
Problem 8

The four adjacent digits in the 1000-digit number that have the greatest product are 9 × 9 × 8 × 9 = 5832.

73167176531330624919225119674426574742355349194934
96983520312774506326239578318016984801869478851843
85861560789112949495459501737958331952853208805511
12540698747158523863050715693290963295227443043557
66896648950445244523161731856403098711121722383113
62229893423380308135336276614282806444486645238749
30358907296290491560440772390713810515859307960866
70172427121883998797908792274921901699720888093776
65727333001053367881220235421809751254540594752243
52584907711670556013604839586446706324415722155397
53697817977846174064955149290862569321978468622482
83972241375657056057490261407972968652414535100474
82166370484403199890008895243450658541227588666881
16427171479924442928230863465674813919123162824586
17866458359124566529476545682848912883142607690042
24219022671055626321111109370544217506941658960408
07198403850962455444362981230987879927244284909188
84580156166097919133875499200524063689912560717606
05886116467109405077541002256983155200055935729725
71636269561882670428252483600823257530420752963450

Find the thirteen adjacent digits in the 1000-digit number that have the greatest product. What is the value of this product?
"""
import numpy as np 
maxProduct = 0
line1 = '''73167176531330624919225119674426574742355349194934
96983520312774506326239578318016984801869478851843
85861560789112949495459501737958331952853208805511
12540698747158523863050715693290963295227443043557
66896648950445244523161731856403098711121722383113
62229893423380308135336276614282806444486645238749
30358907296290491560440772390713810515859307960866
70172427121883998797908792274921901699720888093776
65727333001053367881220235421809751254540594752243
52584907711670556013604839586446706324415722155397
53697817977846174064955149290862569321978468622482
83972241375657056057490261407972968652414535100474
82166370484403199890008895243450658541227588666881
16427171479924442928230863465674813919123162824586
17866458359124566529476545682848912883142607690042
24219022671055626321111109370544217506941658960408
07198403850962455444362981230987879927244284909188
84580156166097919133875499200524063689912560717606
05886116467109405077541002256983155200055935729725
71636269561882670428252483600823257530420752963450'''.replace("\n", "")
series = list(line1)
#Checking the length to see if numbers are put into the list correctly
len(series)
for i in range (0,len(series)):
    series[i] = int(series[i])
def maxProductScope(scope) :  
    s1 = -1
    maxProduct = 0
    for num in series : 
        product = 1
        s1 += 1
        if(s1 == len(series) - scope + 1) : 
            break
        if (0 not in series[s1:s1+scope]) :
            for i in range(0,scope):
                product *= series[s1+i]

        maxProduct = max(maxProduct, product)

    return maxProduct          
maxProductScope(13)<jupyter_output><empty_output><jupyter_text>Code runtime  Processor : 2 GHz Quad-Core Intel Core i7<jupyter_code>from datetime import datetime          
q = datetime.now()  
maxProductScope(13)
print('--------- SURE - ',datetime.now() - q)<jupyter_output>--------- SURE -  0:00:00.001467
{'fraction_non_alphanumeric': 0.045236668663870584, 'fraction_numerical': 0.6144397843019772, 'mean_word_length': 7.88031914893617, 'pattern_counts': {'":': 0, '<': 8, '<?xml version=': 0, '>': 8, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 1, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'chain_length': '2', 'dir': 'jupyter-structured-clean-dedup', 'id': '286372', 'license': 'MIT', 'n_tokens_mistral': 2490, 'n_tokens_neox': 1300, 'n_words': 182, 'path': '.ipynb_checkpoints/Problem 8-checkpoint.ipynb', 'repo_name': 'kutayeroglu/euler-project-solutions', 'size': '3338'}