diff --git a/week1_programming_challenges/2_maximum_pairwise_product/max_pairwise_product.cpp b/week1_programming_challenges/2_maximum_pairwise_product/max_pairwise_product.cpp
index e02a8a3..32311dd 100755
--- a/week1_programming_challenges/2_maximum_pairwise_product/max_pairwise_product.cpp
+++ b/week1_programming_challenges/2_maximum_pairwise_product/max_pairwise_product.cpp
@@ -2,14 +2,14 @@
 #include <vector>
 #include <algorithm>
 
-int MaxPairwiseProduct(const std::vector<int>& numbers) {
-    int max_product = 0;
+long long MaxPairwiseProduct(const std::vector<int>& numbers) {
+    long long max_product = 0;
     int n = numbers.size();
 
     for (int first = 0; first < n; ++first) {
         for (int second = first + 1; second < n; ++second) {
-            max_product = std::max(max_product,
-                numbers[first] * numbers[second]);
+            long long product = 1LL * numbers[first] * numbers[second]; // casting to long long
+            max_product = std::max(max_product, product);
         }
     }
 
@@ -24,6 +24,6 @@ int main() {
         std::cin >> numbers[i];
     }
 
-    std::cout << MaxPairwiseProduct(numbers)<< "\n";
+    std::cout << MaxPairwiseProduct(numbers) << "\n";
     return 0;
 }