help with prime pairs code
Sergey
kornburn at yandex.ru
Mon Feb 3 00:04:17 UTC 2025
On Sunday, 2 February 2025 at 22:40:41 UTC, Jabari Zakiya wrote:
> I am really impressed!
> D is phenomenally memory efficient with this code.
> I just ran the D code for some really large n values.
> On my older Lenovo Legion 5, using Linux (June 2024) w/16GB
> I was able to go up to n = 1,000,000,0000 and it took up
> ~14.4GB max, out of ~14.9GB usable.
> I got a new, fast TUXEDO Gen 3, w/64GB (Jan 2025), so I'm going
> to how high I can go on it.
Nice. Maybe create a github repo with results from different
languages. It will be interesting to see the comparison.
I haven't checked other parts of the code - maybe it is possible
to improve the performance a bit more (to reduce some
allocations, use `appender` instead of `~=` operator)
But will see what other will produce first :)
More information about the Digitalmars-d-learn
mailing list