Multi-row insert vs transactional single row inserts
Yes, it can make a huge difference.

For example, I did a single-statement insert with one million value lists, and it took 7 seconds.  I did one million single-row inserts all in one transaction, and it took 110 seconds.  That is a 15-fold difference.

This is for a case where the table had no constraints or indexes.  Having a single index narrowed the gap down to only be 10 times faster, by slowing both approaches down by few seconds.  Once the index is large enough that it can't be cached in RAM, then both methods will get so much slower that the difference between them may become relatively insignificant.

Note that the accepted answer to the related question you linked is not correct.  Index maintenance is done the same way whether it is a multi-valued insert or a bunch of single-valued inserts--at least for BTree indexes.  There has been talk of optimizing the index maintenance, but if the optimizations are implemented they will probably be done in such a way that it applies to both types of INSERT.