Here's the benchmarking code - see below; I'm unsure how to handle it, as I would like to not let the response chain grow too much, but there are still problems to solve till a final version should be published as a sum up (blazar - would you do that?).

Ikegami's new code is OK now, but Oha's, blazar's and lodin's code not yet; when counting the strings found, I get