ProblemI want to receive advice on my code, which takes 0.012 seconds.import numpy as npimport timestart_time = time.time()raw_data= 7595 6417 47 8218 35 87 1020 04 82 47 6519 01 23 75 03 3488 02 77 73 07 63 6799 65 04 28 06 16 70 9241 41 26 56 83 40 80 70 3341 48 72 33 47 32 37 16 94 2953 71 44 65 25 43 91 52 97 51 1470 11 33 28 77 73 17 78 39 68 17 5791 71 52 38 17 14 91 43 58 50 27 29 4863 66 04 68 89 53 67 30 73 16 69 87 40 3104 62 98 27 23 09 70 98 73 93 38 53 60 04 23def data_input():    a = raw_data.split(\n)    new_a = [x.split( ) if True else None for x in a]    del(new_a[0]) # delete first element in new_a    del(new_a[-1])    return(new_a) # [['75'], ['95', '64'], ['17', '47', '82'], ['18', '35', '87', '10'], ['20', '04', '82', '47', '65'],...def make_memoi_table():    #make a table from below to above (to the top)    new_a = data_input() # new_a : original raw_input data    size = len(new_a)    memoi_table = np.zeros((size,size))    memoi_table[size-1] = [int(x) for x in new_a[size-1]]    for i in range(2,size + 1):        for j in range(len(new_a[size-i])):            memoi_table[size-i][j] = int(new_a[size-i][j]) + max(memoi_table[size-i+1][j],memoi_table[size-i+1][j+1])    return(memoi_table[0][0],memoi_table)print(make_memoi_table())print(--- %s seconds --- % (time.time() - start_time))
Project Euler #18: Maximum path sum I
python;programming challenge;python 3.x