@@ -0,0 +1,210 @@
+from functools import reduce%0A%0Adef main():%0A    number=input().strip()%0A    print(max(%5Breduce(lambda x,y: int(x)*int(y),number%5Bi:i+13%5D) for i in range(len(number)-12)%5D))%0A    %0Aif __name__ == '__main__':%0A    main()%0A

Create project Euler problem 8 sol2.py (#644)