Can anyone send me such algorythm (or post url for related info) for
multiplying big nums? _my_inbox@mail.ru
I heard about n*log(n), but never about n^1.5...
I've solved 1108 with standard n*m complexity without any optimizing
with time ~ 2.5 sec, but i want 0.05 sec without any
precomputations :) .  Also, I guess where is some law in digits order
of the numbers, wich can help to compute each number for O(n).