diff --git a/src/Julia/Problem008.jl b/src/Julia/Problem008.jl
new file mode 100644
index 0000000..a2c5397
--- /dev/null
+++ b/src/Julia/Problem008.jl
@@ -0,0 +1,68 @@
+#=
+Created on 29 Jun 2021
+
+@author: David Doblas Jiménez
+@email: daviddoji@pm.me
+
+Solution for Problem 8 of Project Euler
+https://projecteuler.net/problem=8
+=#
+
+function Problem8()
+    #=
+    The four adjacent digits in the 1000-digit number that have the
+    greatest product are 9 × 9 × 8 × 9 = 5832.
+
+            731671...963450
+
+    Find the thirteen adjacent digits in the 1000-digit number that have
+    the greatest product. What is the value of this product?
+    =#
+
+    NUM = """
+        73167176531330624919225119674426574742355349194934
+        96983520312774506326239578318016984801869478851843
+        85861560789112949495459501737958331952853208805511
+        12540698747158523863050715693290963295227443043557
+        66896648950445244523161731856403098711121722383113
+        62229893423380308135336276614282806444486645238749
+        30358907296290491560440772390713810515859307960866
+        70172427121883998797908792274921901699720888093776
+        65727333001053367881220235421809751254540594752243
+        52584907711670556013604839586446706324415722155397
+        53697817977846174064955149290862569321978468622482
+        83972241375657056057490261407972968652414535100474
+        82166370484403199890008895243450658541227588666881
+        16427171479924442928230863465674813919123162824586
+        17866458359124566529476545682848912883142607690042
+        24219022671055626321111109370544217506941658960408
+        07198403850962455444362981230987879927244284909188
+        84580156166097919133875499200524063689912560717606
+        05886116467109405077541002256983155200055935729725
+        71636269561882670428252483600823257530420752963450
+        """
+
+    num = replace(NUM, "\n" => "")
+    adjacent_digits = 13
+    target = length(num) - adjacent_digits
+    ans, i = 0, 1
+    while i < target
+        a, j = 1, i
+        while j < (i + adjacent_digits)
+            a = a * parse(Int, (num[j]))
+            j += 1
+        end
+        if a > ans
+            ans = a
+        end
+        i += 1
+    end
+
+    return ans
+end
+
+
+println("Time to evaluate Problem 8:")
+@time Problem8()
+println("")
+println("Result for Problem 8: ", Problem8())