Can’t promise anything, but yes, you can expect it next year for sure. 
3 Likes
My consecutive numbers routine is ready. 
It can start at any number not just 1. It is 12 blocks. No check for wrong numbers.
3 Likes
I am extremely sorry, never do it again. 
1 Like
Sounds great! 
Now stop calling yourself a “broddler”. 
3 Likes
Okay. Would be better you could translate it back to English.
2 Likes
I did…
Sorry! 
also extremely sorry for hi-jacking the topic…
I meant no disrespect/misbehaviour…
I’ll delete the post in a minute
Sorry
1 Like
I got 13
I thought over for 10 mins - how did @peter get 12? 
got nothing…
Great!
2 Likes
I have 9 blocks 
1 Like
Are you entered in the KodeJam else i would like to see your blocks? Also of your blocks for the first two challenges.
1 Like
Ah, yes. I’ve checked the list of registered users and was unable to find you @sp4ubw. So, as per the rules, you are not eligible for the Kode Challenges.
1 Like
I thought so. It’s nothing.
1 Like
Thank you for your aia files. I looked at two of them.
In your voweldetector you had the same idea as i had. Great. But i thought the rule of the challenge was to use the
and put the algoritm inside it. I may be wrong.
It is also the same with your consecutive numbers calculator. You did exactly as the challenge was, start from 1.
Nice work, you are a fast Koder. 
5 Likes
Yes, the challenge need to be solved via a return type procedure: you shall submit only the procedure definition; calling the procedure should return the desired value.
2 Likes
I am very curious how to solve challenge number 6. Very, very much.
NO! Use the input block. Do NOT use external components unless absolutely required.
3 Likes
Seeing as Peter and the others are sharing their solutions, maybe I should do the same?
3 Likes
Why not. If the next challenges is visible you can share the solutions to the previous ones.
2 Likes
I’m in the team too!
1 Like
I hope you average the test millisecond results, because a few difference could happen even when running the same code.
For example, a code what requires 11-17 ms to run shows it’s worst, 17ms and another which requires 16-23 ms to run, shows it’s best, 16 ms.
Perhaps ms values are nearly the same when processor is clocked to a constant value.
I didn't get how you Peter did the Link Shortener in 15 blocks, can you (or others) please show an example?
2 Likes
Hi Robert,
I just did what the challenge said, change to only the domain name like in the example. So i removed the front bit and remove the end bit.
So https://www.kodejam.com/challenges/ would become kodejam.com for instance.
Then i made it into an algorithm, 16 blocks.
But this only works with domains that have the format
xxxxxxxxx.domainname.xxx/xxxxxxxxxx
First i cut at the first dot and save the second part. Then i cut at the slash and save the first part.
There is no error control when some parts don’t exist. There is no control if the url is http://kodejam.com. Then it cuts also at the first . and the result is com.
Later i saw i had only to cut the front part, but didn’t make it any further. So your blocks are probably much better then mine.
5 Likes