2 ms·
the first time i read it, i thought he was computing 2^N and turning it into a list of digits. but, no, he was making a list of that length. so, if you're goin
by henning 16y ago
the first time i read it, i thought he was computing 2^N and turning it into a list of digits. but, no, he was making a list of that length.
so, if you're going to pose a challenge to people, you should clearly describe what you're doing and why.
- colomon 16y agoEspecially because once we've sorted out what he is trying to demonstrate (I think) it seems dead trivial to duplicate? I mean, the only thing stopping me from doing that same demo with blazing speed in the deadly slow Rakudo Perl 6 compiler is the speed of calculating 2^100000.... PS For what it's worth, I'm guessing he's doing something more interesting than the dead simple implementation I'm imagining...