New submission from Armin Rigo: If you have in x some very large number, like 3**200000, then the computation for 'str(x)' is sub-efficient. Nathan Hurst posted to the pypy-dev mailing list a pure Python algo that gives the same result in 2/3rd of the time (in either CPython or PyPy). We would get a similar gain by recoding this algorithm in C.
The mail is here: http://mail.python.org/pipermail/pypy-dev/2013-May/011433.html ---------- messages: 190397 nosy: arigo priority: normal severity: normal status: open title: 'str(long)' can be made faster type: performance _______________________________________ Python tracker <rep...@bugs.python.org> <http://bugs.python.org/issue18107> _______________________________________ _______________________________________________ Python-bugs-list mailing list Unsubscribe: http://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com
