diff --git a/ortools/linear_solver/samples/integer_programming_example.cc b/ortools/linear_solver/samples/integer_programming_example.cc
index 468e6a112c..72e3f37e6e 100644
--- a/ortools/linear_solver/samples/integer_programming_example.cc
+++ b/ortools/linear_solver/samples/integer_programming_example.cc
@@ -71,6 +71,7 @@ void IntegerProgrammingExample() {
   // [END objective]
 
   // [START solve]
+  solver->SetNumThreads(8);
   const MPSolver::ResultStatus result_status = solver->Solve();
   // Check that the problem has an optimal solution.
   if (result_status != MPSolver::OPTIMAL) {
diff --git a/ortools/linear_solver/samples/integer_programming_example.py b/ortools/linear_solver/samples/integer_programming_example.py
index 1ec2c9e35f..d80d01d1a3 100644
--- a/ortools/linear_solver/samples/integer_programming_example.py
+++ b/ortools/linear_solver/samples/integer_programming_example.py
@@ -64,6 +64,7 @@ def IntegerProgrammingExample():
 
     # Solve the problem and print the solution.
     # [START print_solution]
+    solver.SetNumThreads(8)
     solver.Solve()
     # Print the objective value of the solution.
     print('Maximum objective function value = %d' % solver.Objective().Value())