For a large class of symmetric random matrices with correlated entries, selected from stationary random fields of centered and square integrable variables, we show that the limiting distribution of eigenvalue counting measure always exists and we describe it via an equation satisfied by its Stieltjes transform. No rate of convergence to zero of correlations is imposed, therefore the process is allowed to have long memory. In particular, if the symmetrized matrices are constructed from stationary Gaussian random fields which have spectral density, the result of this paper gives a complete solution to the limiting eigenvalue distribution. More generally, for matrices whose entries are functions of independent identically distributed random variables the result also holds.