Neighbour search (NS) is the core of any implementations of smoothed particle hydrodynamics (SPH). In this paper, we present an efficient $\mathcal{O}$($N$log$N$) neighbour search method based on the plane sweep (PW) algorithm with $N$ being the number of SPH particles. The resulting method, dubbed the PWNS method, is totally independent of grids (i.e., purely meshfree) and capable of treating variable smoothing length, arbitrary particle distribution and heterogenous kernels. Several state-of-the-art data structures and algorithms, e.g., the segment tree and the Morton code, are optimized and implemented. By simply allowing multiple lines to sweep the SPH particles simultaneously from different initial positions, a parallelization of the PWNS method with satisfactory speedup and load-balancing can be easily achieved. That is, the PWNS SPH solver has a great potential for large scale fluid dynamics simulations.