Help in implementing XOR functions

[Manfizy]

Hi guyz, i have an algorithm that i want to code in java. The algorith is as follows.
MD5 ("1234567890123475e8dd316726b0335") = 8f 43 ae 1a 33 19 c6 49 cc 57 40 8b 6a 39 2d 6b

8f xor 33 xor cc xor 6a =1a
43 xor 19 xor 57 xor 39 =34
ae xor c6 xor 40 xor 2d =05
1a xor 49 xor 8b xor 6b =b3

1a3405b3 and 1ffffff or 2000000 = 23405B3

hex2dec (23405B3) = 36963763

So far i am able to do the MD5 part and come up with the 32 characters. Now my problem comes when doing the XOR functions on the 32 hex characters.
If you have noticed, from the first two characters, the next pick is done after every 6 characters and so on until the 32 characters are done.

I hope have provided sufficient information for anyone to understand whats going on here.

Any one with ideas on where i should start?

Your views are highly appreciated

[Eranga]

What should be the fundamental to work on with XOR, or any other binary operation?

[Manfizy]

What should be the fundamental to work on with XOR, or any other binary operation?

OK am using this algorithm to calculate unlock code for a certain modem.
having done the MD5 part which is used in cryptology, XOR operations are done on the hash string from the MD5.
Basically, what am interested in for now is something like this:

have 8f43ae1a3319c649cc57408b6a392d6b (which is in hex) in an array
THEN
xor functions performed for every 4 bytes

[Eranga]

But anyway we need it in binary form, isn't it?