nqninenmvnpsz874
8twofpmpxkvvdnpdnlpkhseven4ncgkb
six8shdkdcdgseven8xczqrnnmthreecckfive
qlcnz54dd75nine7jfnlfgz
7vrdhggdkqbnltlgpkkvsdxn2mfpghkntzrhtjgtxr
cdhmktwo6kjqbprvfour8
Spoiler warning
As all "Advents of Code" this starts off fairly simple. Walk each rune of the string and do the following:
A. If it's a number, and we haven't seen a number before, store it as the first number.
B. If it's a number, and we have seen a number before, store it as the second number, replacing the old second number.
Once every character is looped over, return the first number multiplied by 11 if there is no second number or the first number multiplied by 10 plus the second number.
Name CPU ns/op # bytes alloc'd per op # of allocs per op
BenchmarkProcessLine-8 14.27 ns/op 0 B/op 0 allocs/op