Timeline for Calculate the Hafnian as quickly as possible
Current License: CC BY-SA 3.0
17 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Mar 8, 2018 at 13:10 | history | edited | ngn | CC BY-SA 3.0 |
slightly more frugal thread spawning, no need to retest
|
Mar 7, 2018 at 10:08 | comment | added | user9206 | @Dennis I used -march=native when testing. | |
Mar 5, 2018 at 15:47 | history | edited | ngn | CC BY-SA 3.0 |
added 2 characters in body
|
Mar 5, 2018 at 15:28 | history | edited | ngn | CC BY-SA 3.0 |
added 52 characters in body
|
Mar 5, 2018 at 15:21 | history | edited | ngn | CC BY-SA 3.0 |
better compiler flags at tio
|
Mar 5, 2018 at 15:07 | history | edited | ngn | CC BY-SA 3.0 |
algorithm description
|
Mar 5, 2018 at 14:52 | comment | added | Dennis | Also, at least on TIO, the executable produced by gcc will be even faster. | |
Mar 5, 2018 at 14:40 | comment | added | Dennis |
-march=native will make a big difference here. At least on TIO, it nearly cuts the wall time in half.
|
|
Mar 5, 2018 at 10:15 | comment | added | ngn | @Lembik the only hard-coded limit is the size of the input buffer, in which I left plenty of room for 100x100 matrix (n=50), so it should be practically unlimited | |
Mar 5, 2018 at 10:00 | comment | added | user9206 | What's the largest size matrix this new code should support? | |
Mar 5, 2018 at 6:55 | history | edited | ngn | CC BY-SA 3.0 |
added 7 characters in body
|
Mar 5, 2018 at 6:37 | history | edited | ngn | CC BY-SA 3.0 |
added 2631 characters in body
|
Mar 3, 2018 at 16:51 | history | edited | ngn | CC BY-SA 3.0 |
max n = 15
|
Mar 3, 2018 at 14:46 | comment | added | ngn | @Lembik For the record, as I said in chat, the input is in the same format as the examples - json (actually, it only reads the numbers and uses n=sqrt(len(input))/2). I usually write short code, even when golfing is not a requirement. | |
Mar 3, 2018 at 13:48 | comment | added | user9206 | Could you show an explicit example of the input your code accepts? Say for a 2 by 2 matrix. Also, you seem to have golfed your code! (This is a fastest-code challenge, not a golf challenge.) | |
Mar 3, 2018 at 12:56 | history | edited | ngn | CC BY-SA 3.0 |
added 70 characters in body
|
Mar 3, 2018 at 12:50 | history | answered | ngn | CC BY-SA 3.0 |