A random number is a random number.
I can solve puzzle 40 in a reasonable amount of time using random numbers and a brute-force approach, whether I use Rust, C++, or any other programming language.
However, puzzle 68 is 268,435,456 times larger than puzzle 40 in terms of the range of numbers that must be generated.
Generating numbers in such a large range is not at all the same as generating numbers for puzzle 40. The computational complexity increases exponentially, making brute-force methods impractical for puzzle 68.
The other methods, such as the Kangaroo method, are very effective. However, if there is no public key, this approach becomes a dead end for ordinary computer users.
If Puzzle 67 was solved , it was likely achieved using a combination of ASICs, optimized algorithms, and possibly distributed computing. They certainly don't have potatoes.