View source for User talk:MikeMol/Time constriction ?

== Time constriction ? ==
Sorry, to bother you again. I have written some code for the task "Arbitrary-precision_integers_(included)" in the programming language AutoHotkey. Now my problem here is the following: the code runs on my PC for '''26 hours''' and then spits out the '''correct''' result. I have used an implementation of BCD multiplication by AHK forum user Laszlo (permission has been granted to publish his code) together with my own implementation of "long powers", that held tight when tested with Euler Challenges. I am as sure as I can possibly be, that this code is correct (forum discussion starts with the second post from the top here: [http://www.autohotkey.com/forum/viewtopic.php?t=44657&postdays=0&postorder=asc&start=225 AHK forum], if you want to have a look). Now I think that pride thing you mentioned yesterday has got a grip on me too, so here is my question: Is there a time constriction at all for submissions to RosettaCode? I assure you that this is not some untested, half-baked code that gets thrown at RosettaCode, but it can be improved. [[User:Wolf|Wolf]] 12.May 2010 14:32h (GMT+2)
: No time constriction. --[[User:Short Circuit|Michael Mol]] 13:42, 12 May 2010 (UTC)

:But isn't a condition of that task that it is only solvable by languages that come with their own in-built implementation of arbitrary precision integers? If you are having to code it then it should not be included. --[[User:Paddy3118|Paddy3118]] 14:09, 12 May 2010 (UTC)
: You're correct. And this is a discussion better suited for that task's talk page. --[[User:Short Circuit|Michael Mol]] 14:22, 12 May 2010 (UTC)