snake_case all the things

project_euler/problem_08/sol1.py

@@ -0,0 +1,15 @@
+import sys
+def main():
+    LargestProduct = -sys.maxsize-1
+    number=raw_input().strip()
+    for i in range(len(number)-13):
+        product=1
+        for j in range(13):
+            product *= int(number[i+j])
+        if product > LargestProduct:
+            LargestProduct = product
+    print(LargestProduct)
+
+
+if __name__ == '__main__':
+    main()