We extend the definition of the non-complete extended $p$-sum (HEPS) of graphs to digraphs (digraphs can have multiple arcs and / or loops). Using the spectral method we prove a theorem giving the necessary and sufficient condition for a NEPS of strongly connected digraphs to be strongly connected. Some related results are obtained.