Sorry if I'm not being clear. In the second paragraph of the Performance Benchmarks page you will see I have linked to the actual source code files that were run to generate the timings.
The first step toward reproducing the benchmarks yourself is to get RPerl installed and passing the basic tests, please see the use RPerl; page for more info. RPerl is still alpha software being developed, so don't hesitate to let me know if you need help or have any questions. I'm often in #perl11 on irc.perl.org if you use IRC.
We already have the basic scalar, array, and hash data types working in RPerl. The "hand-compiled" part of the performance benchmark refers to the fact that RPerl v1.0 is not complete yet and thus there is not yet an actual automatic compiling mechanism in place. Using the working RPerl data types I played the part of a compiler and manually compiled the sorting algorithm code from pure Perl 5 into both RPerl Perl-data mode and RPerl C-data mode, as explained in the Performance Benchmark page.
Did I answer your questions? My goal is to win your support and convince you to make a pledge to the RPerl Kickstarter campaign.
In reply to Re^2: Perl 5 Optimizing Compiler, Part 10: Kickstarter & Performance Benchmarks