Let D be a simple digraph with n vertices, m arcs having skew Laplacian eigenvalues nu(1), nu(2), ... , nu(n-1), nu(n) = 0. The skew Laplacian energy SLE(D) of a digraph D is defined as SLE(D) = Sigma(n)(i=1) vertical bar nu(i vertical bar). We obtain upper and lower bounds for SLE(D), which improves some previously known bounds. We also show that every even positive integer is indeed the skew Laplacian energy of some digraph.