Nice!

good call, still getting used to nasm :p

clean!

you are absolutley right as I used r' registers which are 8 bytes.
I'll fix it.
thanks :)

The declaration of max should be long max(long, long)

You are absolutely right about the pair as i mentioned only 2 vectors
I will rearange the kumite to include "unlimited" vectors(limited by int max value) as there no need for that limitation :)

Edit: done, would love to hear your feedback :)

My solution is less clean and too verbose, but it does not require standard 11/14/17/20, also 15% faster then tuple/pair.

In your solution i would use a pair instead of a tuple:)

Do you find this cleaner/more effecient than my solution?

if so would love to hear why :)

you sorted the array which is less efficient then itterating over it

What's that

Are you... are you yandere dev?

why do it in Θ(nlogn) by sorting when you can just itterate for Θ(n)?

exactly, hence the bug declare.
the result is 'SOS! THE QUICK BROWN FOX JUMPS OVER THE LAZY DOG.'
edit:
was due to bug in my editor :/
B1ts was right there was a tab in the end.
fixed ty :)

If there weren't extra spaces, the test would pass, no?

try adding: std::cout << "'" << your_result << "'" << "\n"; at the end of you function.