fixed for both

Yes, in C too.

Tests in NASM seem identical to C's. I assume the problem is for both languages?

The inputs x and y are always greater or equal to 1

Random tests in NASM can generate zeros.

Not efficient enough. There's a famous math algorithm to find the greatest common divisor

Approved :)

Nasm translation

Read my answer to TechnoDiver just below ;)

Seems tests don't get actualized. I guess with this new fork approved it should be ok (reject if it's useless): https://www.codewars.com/kumite/627ebed6ffea1073bbdd33c2?sel=627f90c7f1b9ed001ab7ceb3

Fixed, thanks.

Go sample tests:

# codewarrior/kata_test [codewarrior/kata.test]
./kata_test.go:13:23: cannot use x (type uint) as type uint32 in argument to kata.Gcd
./kata_test.go:13:23: cannot use y (type uint) as type uint32 in argument to kata.Gcd

Try to use braces systematically, your code will be more readable and this may be the cause of the error (and if it is not it will be easier to catch the problem).

Because this method is too slow. You need to find a more efficient approach. This is one of the best known maths algorithms in history ;)

Can you delete your duplicate post below please?