Hi

Did you notice that the input is hard coded since I did not implemented a general parser.

To get more precise timing I use the following command to measure the execution time:

go test -bench .

In fact the purpose of my message was not to compare go and rust, but to indicate you that your implementation may be not optimized enough. If my version is as fast as a Rust implementation this may come from the use of high order functions to describe monkeys, or the fact that the arrays are never deallocated or resized. This may give you some ideas

For instance when you use the drain method line 142, does this keep the underlying array or does the upcoming push will reallocate memory? I am not expert enough in rust to answer this question

Cheers

Yikes! Will do. Appreciate the thorough work checking my code. I really didn't expect that level of service