MerickOWA wrote:both are lengths of 9
So the length is always calculated with (MaximumCodeWidth * MaximumCodeHeight)?
This leads me to another question, namely how is "speed" measured?
There is e.g. the "Fast String Reversal" challenge where the upper boundary is something about 35, but you should reverse a string that could be up to 100 chars. Well this seems quite impossible for me, I mean you *have* to process at least every char once, so how should that be possible in 35 cycles?
So, either I have understood the wrong thing in "speed" or it *is* in fact possible and I'm thinking too complex (I have to admit I have only solved one challenge so far with SuperHack...) or whatever.
// EDIT:
Oh sorry, regarding the SuperHack description my questions are quite senseless, they're both answered there. In short:
Code size -> counted as size of bounding rectangle
Speed -> measured in cycles BUT per cycle there can be more than one thread executed