Trees (like the ropes you might use in this case) are not necessarily faster on modern CPUs. Caches and branch prediction tend to dominate performance in such cases.
I don't see how branch prediction and caches could dominate performance of logically concatenating a huge amount of text instead of doing it physically.
I guess it depends on what other operations you need. If the only operation you need is concatenation then trees are definitely faster. Otherwise it depends.
Arrays and copies are often faster than the equivalent structure-sharing trees, under a certain size at least.