It's all laid out in the Description. I don't know how much more clear it can be.

Output:

Your function must return the number of valid upside down numbers within the range of the two input arguments, including both upper and lower bounds.

As I found out by trying it expects upper bound to be included (unlike the original kata).

I've never learned assemly in school so even though the kata is easy in its nature, but I learned a lot. Thanks OP.

For those who are actually willing to understand the task, you have a table numbers with one column n.

You have to output a table with two columns, the first being the index (1_based)

Duplicate is retired in the meantime.

Thanks for the translation. However, there was little information about inputs provided with this setup, so I published a new fork that improves it.

Approved :)

In case you're still interested in this, I found out during some testing that rule on insert requires all values to be provided during insert to function correctly (at least in this particular case). This is not true here though, since the test code doesn't explicitly insert id's, relying on that column's autoincrement capability instead.

I've added a note hinting towards this fact instead of modifying the tests because the original idea behind this kata was to use "t", and I'd like it to remain that way (plus, it's more realistic, since normally people don't provide values for autoincrementing primary key columns, making rule a not 100% correct choice).

Duplicate numbers aren't tested.

The connection just times out on me when I try and run my solution for this kata—do you have any idea what is going on?

Nice to see another kata for Prolog, by the way!

In the description, it´s unclear from where to retrive data (table schema - numbers), and also the output schema (in the graphic seems that column should be integer and it is n).

nice

• added C++ example to description
• added sample tests
• added missing includes
• changed params to const ref
• removed polluting using namespace std
• moved ref solution to local scope
• fixed overflow in random tests
• used simpler syntax in some places

I created a NASM translation with the updated description.