The biggest problem with this benchmark is that it uses nested lists (read: memory indirections), whereas the other implementations (or at least the C one) uses flat storage.
Alex On Sun, Apr 7, 2013 at 4:30 AM, Dimitri Vorona <alen...@googlemail.com>wrote: > Hi everyone, > > just wanted to bring to your attention this blog post: > http://attractivechaos.wordpress.com/2013/04/06/performance-of-rust-and-dart-in-sudoku-solving/ > . > PyPy ist compared with various dynamic and static languages. > > While the perfomance is still OK (within an order of magnitude of C), it > places last by a quite big margin. I would like to know if these result > match your benchmarks or is the implementation of the sudoku solver > non-optimal for pypy (can be seen here > https://github.com/attractivechaos/plb/blob/master/sudoku/sudoku_v1.py) > > Regards, > > Dmytro Vorona. > > _______________________________________________ > pypy-dev mailing list > pypy-dev@python.org > http://mail.python.org/mailman/listinfo/pypy-dev > > -- "I disapprove of what you say, but I will defend to the death your right to say it." -- Evelyn Beatrice Hall (summarizing Voltaire) "The people's good is the highest law." -- Cicero GPG Key fingerprint: 125F 5C67 DFE9 4084
_______________________________________________ pypy-dev mailing list pypy-dev@python.org http://mail.python.org/mailman/listinfo/pypy-dev
