Message390940
| Author |
Carl.Friedrich.Bolz |
| Recipients |
BreamoreBoy, Carl.Friedrich.Bolz, eric.smith, fredrikj, mark.dickinson, pernici, serhiy.storchaka, steve21, vstinner, xuanji |
| Date |
2021年04月13日.08:55:52 |
| SpamBayes Score |
-1.0 |
| Marked as misclassified |
Yes |
| Message-id |
<1618304152.97.0.847733307949.issue3451@roundup.psfhosted.org> |
| In-reply-to |
| Content |
FWIW, we have implemented a faster algorithm for divmod for big numbers using Mark's fast_div.py in PyPy. In particular, this speeds up str(long) for large numbers significantly (eg calling str on the result of math.factorial(2**17) is now 15x faster than CPython ;-)). |
|