diff --git a/routing/astar_router.cpp b/routing/astar_router.cpp
index 3f0e01d44f..831485ebec 100644
--- a/routing/astar_router.cpp
+++ b/routing/astar_router.cpp
@@ -10,7 +10,9 @@ namespace routing
 {
 double const kMaxSpeedMPS = 5000.0 / 3600;
 double const kEpsilon = 1e-6;
-int const kCancelledPollPeriod = 100;
+
+// Power of two to make the division faster.
+uint32_t const kCancelledPollPeriod = 128;
 
 namespace
 {
@@ -112,7 +114,7 @@ IRouter::ResultCode AStarRouter::CalculateRouteM2M(vector<RoadPos> const & start
     queue.push(Vertex(rp, 0.0));
   }
 
-  int steps = 0;
+  uint32_t steps = 0;
 
   while (!queue.empty())
   {
diff --git a/routing/dijkstra_router.cpp b/routing/dijkstra_router.cpp
index 17dad8baa6..69995a55a6 100644
--- a/routing/dijkstra_router.cpp
+++ b/routing/dijkstra_router.cpp
@@ -10,7 +10,9 @@
 
 namespace routing
 {
-int const kCancelledPollPeriod = 100;
+
+// Power of two to make the division faster.
+uint32_t const kCancelledPollPeriod = 128;
 
 namespace
 {
@@ -78,7 +80,7 @@ IRouter::ResultCode DijkstraRouter::CalculateRouteM2M(vector<RoadPos> const & st
   for (auto const & p : dist)
     queue.push(Vertex(p.first, 0.0 /* distance */));
 
-  int steps = 0;
+  uint32_t steps = 0;
 
   while (!queue.empty())
   {