Given an n-vertex planar directed graph with real edge lengths and with no negative cycles, we show how to compute single-source shortest path distances in the graph in O(n(log n)^2/loglog n) time with O(n) space. This is an improvement of a recent time bound of O(n(log n)^2) by Klein et al.