INTER - time limit exceeded

[Gunde]

I have been trying to solve INTER for a few hours now and I am just unable to do it within the time limit.
Since I am new to python I have most likely made several stupid misstakes, but I am unable to spot them.

My code looks like this:

import psyco;psyco.full()
def B(n):
  b = ''
  while n > 0:
    j=n&1;b=str(j)+b;n>>=1
  return b
def A(s):
  o=''
  for p in range(len(s)):
    o+=str(int(s[p])^1)
  return o
def M(s):
  ts=int(A(s[32:48]),2);ln=48+ts
  print A(B(int(A(s[48:ln]),2)%int(A(s[:32]),2)))
  return s[ln:]
q=raw_input()
while 1:
  q=M(q)
  if(not len(q)):
    break

I believe the problem might be my output, but I am not really sure how to output in a faster fashion.
Any help would be appreciated.

[numerix]

First: psyco doesn't help here.

Second: I worked on the problem yesterday and it seems that is too expensive if you cut off the input piece by piece.
I did several optimizations on the rest - even psyco -, but whenever I did it cutting of the input piece by piece I got TLE. So use another way to go through the input ...

[Gunde]

I just can't get it to work.

I tried adding the n1's and n3's to a list (in binary) while XORing the entire input:

1. XOR 32 bits, add them to buffer and add to list.
2. XOR 16 bits, convert to int and XOR the result bits (add them to list)
3. REPEAT

this was done bit by bit in one itteration throughout the entire input string. Did not seem to help.

To me it seems like the many conversions between binary and int (and other way around) is what is slowing me down,
especially calculating n2 and then the modulo, but who knows...

[numerix]

You cannot avoid a lot of conversions between dec and bin, but try to avoid building up or changing any kind of sequence (str or list). Just walk through the input-string.