sort: improve performance for very long lines (#12138)

[sylvestre]

No description provided.

[github-actions]

GNU testsuite comparison:

Skip an intermittent issue tests/date/date-locale-hour (fails in this run but passes in the 'main' branch)
Skipping an intermittent issue tests/pr/bounded-memory (passes in this run but fails in the 'main' branch)
Skipping an intermittent issue tests/tail/tail-n0f (passes in this run but fails in the 'main' branch)

[codspeed-hq]

Merging this PR will degrade performance by 3.9%

⚠️ Different runtime environments detected

Some benchmarks with significant performance changes were compared across different runtime environments,
which may affect the accuracy of the results.

Open the report in CodSpeed to investigate

⚡ 1 improved benchmark
❌ 1 regressed benchmark
✅ 315 untouched benchmarks
⏩ 46 skipped benchmarks¹

⚠️ Please fix the performance issues or acknowledge them on CodSpeed.

Performance Changes

	Mode	Benchmark	BASE	HEAD	Efficiency
⚡	Simulation	sort_long_line[10000]	423.1 µs	409 µs	+3.46%
❌	Simulation	sort_key_field[500000]	767.8 ms	799 ms	-3.9%

---

_{Comparing sylvestre:sort-per-impl (dec19b3) with main (485b156)}

Footnotes

1. 46 benchmarks were skipped, so the baseline results were used instead. If they were deleted from the codebase, click here and archive them to remove them from the performance reports. ↩

[oech3]

see #12150 and #12144

[sylvestre]

Oh, missed them. Thanks