changed []byte to string after finding out string indexing is faster than []byte in Go, since we're never modifying our string and only working with the accumulator we should see an improvement in speed in general

mishmash.go

 	return primes[n&0xff]
 }
 
-func Engine(buffer []byte, length int, accumulator uint64) uint64 {
+func Engine(buffer string, length int, accumulator uint64) uint64 {
 	for i := 0; i < length; i++ {
 		b := buffer[i]
 		accumulator += uint64(slct(accumulator)) + uint64(b)
 	return accumulator
 }
 
-func Mishmash(buffer []byte, nums ...uint64) uint32 {
+func Mishmash(buffer string, nums ...uint64) uint32 {
 	// nums is a seed/accumulator
 	var accumulator uint64
 	if 0 == len(nums) {
 // example below used to validate output against C++ mishmash
 /*
 func main() {
-	buf := []byte("Hello world!")
+	buf := "Hello world!"
 	first := MishmashAccumulator(Engine(buf, len(buf), 0))
 	second := MishmashAccumulator(Engine(buf, len(buf), 1))
 	var combo uint64