{ !rant, devlog }

I finished an exercise on Deletable Primes at http://catcoder.codingcontest.org just as part of my training for when I'm going to attend hackathons.
I could've done better than 08m 44s, by 3 minutes, if I hadn't made my initial IsPrime() method so damn inefficient that a large number wouldn't stop calculating, making me quickly debug and find the issue...

I used C#, because that's the language I currently just write most of my stuff in (and thus, I'm the fastest in out of all langs I know)

Gist: https://gist.github.com/filthycodin...