I wanted to play around with Nim GMP for [a much simpler experiment](https://pastebin.com/raw/yDtNktYz): seeing how long it would take to find a `clong.rand` array that [SO3C](https://en.wikipedia.org/wiki/Sums_of_three_cubes) to <2 billion, which is billions of times easier than hitting a specific number. Turns out: quite a while... 🙄
* * * > > but it wasn't meant to compete with hand-optimized C / Fortran / Assembly > > language. > > Sure it was. By design C-like Nim code has no overhead. I should have just said "hand-optimized Assembly language"...
