Solved problems:
001 - C# and perl
002 - C# and perl
003 - C, C#, and perl
004 - C#, perl
005 - C#, perl
006 - C#, perl
007 - C#, perl
008 - C#, perl
009 - C#, perl
010 - C# and perl
011 - C#
012 - C#
013 - C# and perl
014 - C# and perl
015 - C
016 - C# and perl
017 - C#
018 - C#
019 - C#
020 - C# and perl
021 - C# and perl
022 - C#
024 - ruby
025 - C# and perl
028 - C#
030 - perl
032 - ruby
034 - C#
035 - perl
037 - C#
038 - ruby
046 - ruby
048 - C# and perl
065 - ruby
067 - C#
079 - solved with pen and paper
089 - ruby
092 - ruby (takes a bit less than 20 minutes to run)
097 - C#, perl
145 - C# (takes < 3 minutes)
387 - C# (takes much longer than a minute to run)
Utilities:
printprimes_test - C - Learning and testing the GMP interface
PrintPrimes - C# - utility to help create primes.cs used in PE.dll
C# code comes in two flavors. 1st being the PE library that uses the BigInteger library from Microsoft that is part of .Net 4. 2nd being the ProjectEuler library that uses an open source BigInt library from CodeProject.
Perl code uses these libraries (available from CPAN): Math::Factor::XS, Math::Fibonacci, Math::Pari, and Math::Prime::XS.
C code uses the gmp-mini library from the GMP project.
Ruby code uses these libraries (available from RubyGems.org): roman-numerals.
All code runs in less than 10 seconds. Project Euler suggests runtimes of less than a minute.