I finally done a library for Java with support of 256 bit integer arigthmetic, and other operations. Actually I did also 128 bit one. These have support for both signed and unsigned numbers.
So some results
add 101 - 150 ms
sub simillar
div between 10 s - 19 s
mul 1300 ms
All tested for 1000000 itereations. Thus for example add is aprox up to 250 cycles.
I know I should post it in anoncements, but I would like to know if I didn’t missed any algorithms that could speed things up.