Project Euler 8 - Largest Product in a Series

Official link:

Thought Process

Go through the big number and use a modified digit sum function to calculate the digit product of each 13 digit number, only need to do 986 iterations

Interactive Code

Input an integer (yourinput)

Code will output the largest digit product of length yourinput