There is a well-studied correspondence by Jaclyn Anderson between partitions that avoid hooks of length s or t and certain binary strings of length s+t. Using this map, we prove that the total size of a random partition of this kind converges in law to Watson's U^2 distribution, as conjectured by Doron Zeilberger.