[issue3451] Asymptotically faster divmod and str(long)

Carl Friedrich Bolz-Tereick report at bugs.python.org
Tue Apr 13 04:55:52 EDT 2021


Carl Friedrich Bolz-Tereick <cfbolz at gmx.de> added the comment:

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 ;-)).

----------
nosy: +Carl.Friedrich.Bolz

_______________________________________
Python tracker <report at bugs.python.org>
<https://bugs.python.org/issue3451>
_______________________________________


More information about the Python-bugs-list mailing list