My first ever question Find all integer pairs that produce a given Loeschian number was a straightforward code-golf tagged problem. I copied the format from an earlier related question, including the line:
This is code golf so shortest code wins.
In this case it seems that when I'm ready and certain things have settled down, I should simply accept the answer with the lowest final byte count.
If there are more than one answer with the lowest byte count (which appears to be the case now with two at 9 bytes) then I can either refrain from acceptance, or choose one on a secondary criteria of my choosing.
Have I got it right, or are there other things I might consider?