You're probably not doing Dijkstra's algorithm the right way.
Usually, puzzles on CodinGame use graphs where every vertices have the same weight so a simple breadth first search with a queue gives you the right result. However, Dijkstra's algorithm actually say you have to take the closest unvisited node so in a case where vertices have different weights, your queue must always be sorted by distance. Otherwise, you're visiting some nodes too soon because there could be a shorter path with more nodes than the one you took with the breadth first search.
Anyway, I got the same issue as @lilian_cartellier: I pass the "Large number of stages" test in IDE but fail it during validation and I don't know why...
Edit: My bad, I forgot to convert degrees to radians... Though I'm now surprised everything else works with wrong distances