hacker.org

Two things: with the g/w instruktions, you can modify your program at runtime?
Second, thee is no "drop" instruktion like "d" in HVM?

That knows only the generation <20. I know such thinks only from a simple LED calculator.

Take a look at OpenSSL, it helps.

I used the same hash function as efe, but you get better results if you use a prime number thats not to close to a power of 2.

I had a similar idea, but I didn't find a function that always give me a zero except for one specific value. I didn't think to use the memory for this.

No, I used a hash function.

I don't like my solution:

1<0<1<-25*0^*3*+2*c {Spaces till pos. 600}p! {min. 600Spaces}0<p

There are only two limitations within my program:
1) No zero in the array.
2) The elements of the array have to be unique.

I only use "<" twice, no ">".

My program only works for numbers with a difference smaller than 300. Has someone a solution without this limitation?

If you want to calculate time or space that a program needs you look at the input and that are 128 elements, and not 8128 tupels. Cycles in HVM are the same as time.

Your calculation is wrong. There are 128 numbers given, so you have 10000/128 (~78 ) cycles per number. Thats pretty much.

I've got 8 messages from him in about8 minutes. Bann him!

Whats the problem with writing the names of the challenges? You can easily get them, when you are logged in.

My mouse stops at zero in mem, but contains no ::> instruction.

Your very funny. Writing three post in 25 minutes and expect a answer. Try to solve some of the challenges.