Page 2 of 2
Posted: Sun Oct 03, 2010 3:04 am
by stabat
That depends entirely on the compiler used. In my environment sizeof(long) is 4 bytes. You should use a long long if you want a guaranteed size of at least 8.
even if I reply one year later, I have to say that it depends on the computer architecture the compiler runs on, and not from the compiler itself
Posted: Fri Jun 03, 2011 5:52 pm
by laz0r
Can someone confirm for me that:
16908034*33489918 + 84606743 == 118096409 in this endianness?
Posted: Tue Aug 30, 2011 4:59 pm
by laz0r
*bump* - another candidate I get is 67633157 for the answer to my question above.
Posted: Fri May 25, 2012 2:13 pm
by dangermouse
if you are using Python, you can probably solve the challenge straight away. But in my case I was using Freepascal, and the problem was the multiplication (not the modulo thing) which overflowed differently. This bignum library helped:
http://home.netsurf.de/wolfgang.ehrhardt/mp_intro.html
Posted: Fri May 25, 2012 4:36 pm
by AMindForeverVoyaging
dangermouse wrote:if you are using Python, you can probably solve the challenge straight away.
Python has built-in support for hacker.org Didactic challenges? That's seriously cool!
Posted: Thu Aug 02, 2012 1:36 pm
by brahim
Hello
Are all characters in the plaintext ASCII (7 bits)?
Posted: Thu Aug 02, 2012 3:32 pm
by dangermouse
Yes, all ASCII are below 128 and represent normal chars. No crazy char in there as usual.
Posted: Fri Jun 28, 2013 12:58 am
by Isaev
And what means (txt
-> txt[i + 3]) ? more precisely -> 
The length of the string
Posted: Fri May 09, 2014 1:49 pm
by SemmZemm
Encoded string is 220 symbols length = 110 bytes, not divisible by 4. Where did last 2 bytes (b40e) come?
Posted: Mon May 12, 2014 8:58 am
by mickeyandkaka
test
I just want to see my uid