The original goal is to bound the character ratio $r_\lambda(\vec{x}) := \chi_\lambda(x_1, \ldots, x_n) / d_\lambda$ from above, so that we get $$ d_\lambda r_\lambda(\vec{x})^k = o(1),$$ for $k = O(1)$, uniformly for all $\lambda \neq 0^n$. Here the condition on $\vec{x} \in \mathbb{T}^n $ is that $\mathbb{P}(\mid\sum_i x_i \mid > y) < e^{-c y^2}$, that is, sub-Gaussian.
More specifically, I can actually assume that $\mathbb{P}(\mid \sum_i x_i^j \mid > y) < e^{-c_j y^2}$ for all $j < J$, a fixed constant that can be as large as I need. By Fourier analysis on the circle, this should imply that $\vec{x}$ viewed as a point mass distribution on $\mathbb{T}$. is close to a mixture of clumped uniform distributions $\nu_{j, \theta}$ on $\mathbb{T}$ with high probability, where $\nu_{j, \theta} := \frac{1}{j} \sum_\ell \delta_{e^{i(\theta + 2\pi \ell / j)}}$.
More conveniently, let $x_i = e^{\sqrt{-1} t_i}$. The above conditions should imply that $\mathbb{P}(\mid \#\{t_i \in [a, b]\} - \frac{b-a}{2\pi}\mid > \epsilon)$ is small. Then I can divide $[0, 2\pi)$ into $J$ equal contiguous segments, and let $\nu_J$ be the distribution with point mass of $1/J$ at each midpoint of the $J$ segments, and let $\vec{\xi_J}$ be the corresponding $n$-vector on $\mathbb{T}$ that has $\nu_J$ as its empirical distribution. The bigger $J$ is, the smaller $\chi_\lambda(\vec{\xi_J})$ and can be estimated by assuming the contours of $z_j$ to be centered circles of the same radius, at least for type A.
To estimate the contour integral in the case of $s$-picket fence distribution of $x_k$'s, we stipulate that the contour for each $z_j$ is a centered circle with radius $r_j$. Then the following formula gives an upper bound on the maximum of the integrand: $$\mid \prod_j \prod_{k=1}^s (1 - z_j e^{2\pi i k / s})^{-n/s} \prod_{j < k} (z_j - z_k) \prod_{j=1}^n z_j^{-\lambda_j + j -n -1} \mid \ll \prod_j (1 - r_j^s)^{-n/s} n^{n/2} \prod_{j=1}^n r_j^{-\lambda_j - 1}.$$ Here we use the result from this MO threadthis MO thread.
Optimizing the expression in 4 above, we find that the optimal $r_j^s = \frac{\lambda_j + 1}{n + \lambda_j + 1}$.
If we let $s=2$, then for $\lambda =\delta = (n-1, n-2, \ldots, 0)$, then bound obtained for $\Phi_\lambda$ above is up to lower order term exactly $2^{n^2/2}$, which agrees with $d_\lambda$, but is insufficient to prove $d_\lambda (\Phi_\lambda / d_\lambda)^{O(1)} = o(1)$.
Macdonald p. 47 has an expression for $s_{(a+1, 1^b)}$ in terms of an alternating sum of product of $h_s$ and $e_t$: $$s_{(a+1, 1^b)} = h_{a+1} e_b - h_{a+2} e_{b-1} +\ldots + (-1)^b h_{a+b}.$$