Yes, there are. I just wrote a paper about it, actually.
You need to define carefully what you mean by obtaining a Bell violation or ruling out local hidden variables. You can't demand to have a result which is impossible to explain with local hidden variables: the local bound of a Bell inequality is inherently probabilistic, so it is possible to obtain any statistic you observe merely by chance. What you can do is demand it to be unlikely, with $p$-value smaller than some threshold, or Bayes factor above some threshold. For example, in one of the loophole-free Bell tests they reported that the $p$-value of their data under the local hidden variables hypothesis was below $10^{-30}$.
In a single-shot scenario, the $p$-value of winning a single round of a nonlocal game is simple its local bound, the maximal probability of winning it with local hidden variables. If you can make the local bound smaller than this threshold, while keeping the quantum probability of victory close to 1, then you'll have a single-shot violation.
It turns out that it is possible to construct (families of) nonlocal games such that the local bound becomes arbitrarily close to 0, while the Tsirelson bound becomes arbitrarily close to 1, so yes, a single-shot violation is possible for any threshold you want.
The simplest way of constructing such a game is by doing parallel repetition of a pseudo-telepathy game, that is, playing $n$ times in parallel a nonlocal game with Tsirelson bound 1. The local bound goes down to zero exponentially in $n$ (this is highly nontrivial to prove), while the Tsirelson bound stays equal to 1, so there you have it.
This construction is physically meaningless though, because the local bound here is the probability of winning all parallel instances simultaneously, which you'll never be able to do in reality, so the fact that it is exponentially unlikely with local hidden variables doesn't help you. There are more sophisticated constructions that solve this problem: instead of considering the probability of winning all instances, you can also consider the probability of winning a fraction of instances higher than what you'd expect from the local bound: it turns out that this still goes down to zero exponentially with $n$ under the local hidden variables hypothesis, as proven by Rao's concentration bound, and goes up to one exponentially with $n$ under quantum mechanics. Now this is robust to experimental errors, so it is the way to do it in reality.
You might find unsatisfactory the use of parallel repetition; well there also exists a nonlocal game, the Khot-Vishnoi game, such that the local bound is arbitrarily close to zero and the Tsirelson bound arbitrarily close to one, and it is not based on parallel repetition. This game is very hard to implement experimentally, though.