Geocaching: benötige Hilfe bei Bash-Skript bzw. Alternative in C

package geomd5;


import java.security.MessageDigest;
import java.security.NoSuchAlgorithmException;


public class GeoMD5 {


	public static void main(String[] args) {
		final String geocache = "39476e43fa1cf7b44c5c373b22166e22";
		final String sNordString = "N51° 2";
		final String sOstString = "E006° 2";


		char[] sNord = sNordString.toCharArray();
		char[] sOst = sOstString.toCharArray();
		char sDot = '.';
		char sEnd = '\'';


		String hash = "";
		String coord = "";
		StringBuilder coordSb = new StringBuilder();
		long count = 0;
		int tmpcount = 0;


		long start = System.currentTimeMillis();
		long tmpt;


		int v0 = 0;
		int v1 = 0;
		int v2 = 0;
		int v3 = 0;
		int v4 = 0;
		int v5 = 0;
		int v6 = 0;
		int v7 = 0;


		while (v0 < 10) {
			while (v1 < 10) {
				while (v2 < 10) {
					while (v3 < 10) {
						while (v4 < 10) {
							while (v5 < 10) {
								while (v6 < 10) {
									while (v7 < 10) {
										count++;
										tmpcount++;


										coordSb.append(sNord);
										coordSb.append(v0);
										coordSb.append(sDot);
										coordSb.append(v1);
										coordSb.append(v2);
										coordSb.append(v3);
										coordSb.append(sEnd);
										coordSb.append(" ");
										coordSb.append(sOst);
										coordSb.append(v4);
										coordSb.append(sDot);
										coordSb.append(v5);
										coordSb.append(v6);
										coordSb.append(v7);
										coordSb.append(sEnd);
										coord = coordSb.toString();
										coordSb.delete(0, coordSb.length());
										hash = md5sum(coord);
										if (hash.equals(geocache)) {
											System.out.println("Lösung gefunden nach " + count + " Versuchen:");
											System.out.println(coord + " : " + hash);
										}
										// alle x Durchläufe einen Status abgeben:
										if (tmpcount == 5000000) {
											tmpt = System.currentTimeMillis();
											System.out.println(count + " : " + coord + ": " + hash + "(ms since start: " + (tmpt - start) + ", " + ((count * 1000) / (tmpt - start)) + "/s)");
											tmpcount = 0;
										}
										v7++;
									}
									v6++;
									v7 = 0;
								}
								v5++;
								v6 = 0;
							}
							v4++;
							v5 = 0;
						}
						v3++;
						v4 = 0;
					}
					v2++;
					v3 = 0;
				}
				v1++;
				v2 = 0;
			}
			v0++;
			v1 = 0;
		}
	}


	private static String md5sum(String string) {
		StringBuffer hexString = new StringBuffer();
		try {
			MessageDigest digest = MessageDigest.getInstance("MD5");
			digest.reset();
			digest.update(string.getBytes());
			byte[] result = digest.digest();
			String tmp;
			for (int i = 0; i < result.length; i++) {
				tmp = Integer.toHexString(0xFF & result[i]);
				if (tmp.length() > 1) {
					hexString.append(tmp);
				} else {
					hexString.append("0" + tmp);
				}
			}
		} catch (NoSuchAlgorithmException e) {
			e.printStackTrace();
		}
		return hexString.toString();
	}
}

#!/usr/bin/perl
# -*- coding: utf-8 -*-
#use strict;
use Digest::MD5 qw(md5_hex);
my $tofind = '39476e43fa1cf7b44c5c373b22166e22';
my $string;
for (my $north = 20000; $north <= 29999; $north++) {
  for (my $east = 20000; $east <= 29999; $east++) {
    $string = 'N51° '.substr($north, 0, 2).'.'.substr($north, 2).'\' '.
              'E006° '.substr($east, 0, 2).'.'.substr($east, 2).'\'';
    if (md5_hex($string) eq $tofind) {
      utf8::decode($string);
      print "$string\n";
      exit;
    }
  }
}

#include <stdio.h>
#include <string.h>
#include <openssl/md5.h>


int hex2int(char c)
{
  if(c >= '0' && c <= '9')
    return c - '0';
  if(c >= 'A' && c <= 'F')
    return c - 'A' + 10;
  if(c >= 'a' && c <= 'f')
    return c - 'a' + 10;
  return -1;
}


void main()
{
  int i;
  int n1, n2, e1, e2;
  char str[30];
  char tofind[] = "39476e43fa1cf7b44c5c373b22166e22";
  unsigned char tofindbin[16];
  unsigned char *md5buf;


  for (i = 0; i < 16; i++) {
    tofindbin[i] = (hex2int(tofind[i * 2]) << 4) + hex2int(tofind[i * 2 + 1]);
  }
  for (n1 = 20; n1 <= 29; n1++) {
    sprintf(str, "N51° %d.", n1);
    for (n2 = 0; n2 <= 999; n2++) {
      sprintf(str + 9, "%03d' ", n2);
      for (e1 = 20; e1 <= 29; e1++) {
        sprintf(str + 14, "E006° %d.", e1);
        for (e2 = 0; e2 <= 999; e2++) {
          sprintf(str + 24, "%03d'", e2);
          md5buf = MD5(str, 28, NULL);
          if (!memcmp(md5buf, tofindbin, 16)) {
             printf("Lösung: %s\n", str);
             return;
          }
        }
      }
    }
  }
}