Formulate an algorithm for fast evaluation of:
Σ_j=1,...,n² (floor (√j) + ceil (√j)), where n is a positive integer.

** ceil(x) is the least integer ≥ x and, floor(x) is the greatest integer ≤ x