### Project Euler - problem 8

You are presented with a 1000-digit number and you must find the 13 adjacent numbers with the greatest product.

In Python 3, a solution might looks like this

Good luck.

You are presented with a 1000-digit number and you must find the 13 adjacent numbers with the greatest product.

In Python 3, a solution might looks like this

Good luck.