2018-12-24 17:02:56 +0100 | received badge | ● Nice Question (source) |
2018-01-22 01:29:44 +0100 | received badge | ● Famous Question (source) |
2017-07-14 16:41:42 +0100 | received badge | ● Notable Question (source) |
2017-07-14 16:41:42 +0100 | received badge | ● Popular Question (source) |
2014-07-13 05:57:16 +0100 | received badge | ● Scholar (source) |
2014-07-13 05:56:46 +0100 | commented answer | Fast (uniform) random integer generation It doesn't actually seem to be as fast as numpy, which runs in about a 40th of the time in my benchmark. |
2014-07-13 05:56:09 +0100 | commented answer | Fast (uniform) random integer generation Looks like the last of these is the fastest, thanks. |
2014-07-11 19:42:07 +0100 | received badge | ● Student (source) |
2014-07-11 19:34:54 +0100 | asked a question | Fast (uniform) random integer generation I'm doing some largish experiments involving randomness, and I think random number generation may be the bottleneck. Is there a way to make the random number generator significantly faster without sacrificing the validity of results? I don't especially care that the RNG be cryptographically secure or anything like that. |