Timeline for Long multiply, 8 bits at a time
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 7, 2021 at 21:17 | answer | added | EasyasPi | timeline score: 0 | |
| Jun 5, 2018 at 13:54 | comment | added | 12Me21 | +1 for correct byte order | |
| Jun 5, 2018 at 0:43 | answer | added | l4m2 | timeline score: 0 | |
| May 4, 2011 at 20:14 | vote | accept | Keith Randall | ||
| Apr 12, 2011 at 15:31 | comment | added | Keith Randall | @Timwi: You can do anything you'd like 16 bits at a time. Adds, shifts, whatever. Any larger operation you need to synthesize yourself. | |
| Apr 12, 2011 at 14:22 | answer | added | Timwi | timeline score: 14 | |
| Apr 12, 2011 at 12:17 | comment | added | Timwi | What about addition? Can we pretend to have a ready-made arbitrary-size addition function? If not, what can we add? | |
| Apr 12, 2011 at 0:20 | answer | added | Matías Giovannini | timeline score: 4 | |
| Apr 12, 2011 at 0:09 | answer | added | mrmekon | timeline score: 4 | |
| Apr 11, 2011 at 20:53 | history | tweeted | twitter.com/#!/StackCodeGolf/status/57546946310717440 | ||
| Apr 11, 2011 at 6:04 | comment | added | FUZxxl | This is crucial for languages, that have no default 8-bit type, like Haskell. | |
| Apr 11, 2011 at 4:59 | history | asked | Keith Randall | CC BY-SA 3.0 |