We investigate asymptotic probabilistic phenomena arising from the application of the Schensted row insertion algorithm, a key component of the Robinson-Schensted-Knuth (RSK) correspondence, to random inputs. Our analysis centers on a random tableau $T$ with a given shape $λ$, which may itself be random or deterministic. We examine the stochastic properties of the position of the new box created when inserting a deterministic entry into $T$. Specifically, we focus on the fluctuations of this position around its expected value as the size of the Young diagram $λ$ approaches infinity. Our findings reveal that these fluctuations are asymptotically Gaussian, with the mean and variance expressed in terms of Kerov's transition measure of the diagram $λ$. An important application of this analysis is the RSK algorithm applied to a finite, long sequence of independent, identically distributed random variables. While there remains a gap in the reasoning for this case, we present an explicit conjecture regarding its behavior.