That's clever. Alas, Snap!'s scheduler doesn't do real time slicing; it relies on explicit yields that Snap! carries out at the bottom of every loop iteration. So if the first script doesn't have any loop blocks (for example, it uses recursion instead) it'll win the race even if it actually takes more time than the second script.