Timeline for Big integer multiplication
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 6, 2016 at 16:40 | comment | added | Erik the Outgolfer | I think you can do def x(c,y,r,k=0) and remove the k=0 line to golf one byte. | |
| Jul 30, 2016 at 6:11 | comment | added | univalence | @userunknown: Nope, you can't, but the limit is very high, about 10 **8 | |
| S Jul 30, 2016 at 5:07 | history | edited | Leaky Nun | CC BY-SA 3.0 | added 32 characters in body |
| Jul 30, 2016 at 4:59 | review | Suggested edits | |||
| S Jul 30, 2016 at 5:07 | |||||
| Jun 1, 2012 at 19:59 | comment | added | boothby | lol, yup. This code will work for every possible input for which the input & output fit in memory. Being base 10, there's a fairly wide gulf between what you can do with your int accumulator and my carries-in-memory -- as I noted on ugoren's solution. | |
| Jun 1, 2012 at 19:51 | comment | added | user unknown | Haha! You don't blow the 64-bit limit, but Python does? Wait ... | |
| Jun 1, 2012 at 19:48 | comment | added | boothby | @userunknown, the rules have been updated -- if Python limits string length, that isn't up to me. | |
| Jun 1, 2012 at 19:02 | comment | added | user unknown | You can store Strings of arbitrary size in Python? | |
| May 31, 2012 at 23:30 | history | answered | boothby | CC BY-SA 3.0 |