Optimize Enumerable#sum for integer ranges #2359
Merged
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
We can simply shortcut this with the Guass formula for summing integers. It turns out MRI does this too
Benchmarking this with
(1..1000000).sum
, this takes roughly 1.5 seconds on master (on my machine, release build), and only 0.00003 seconds with this patch. MRI is still roughly 10 times as fast.Inspired by https://mastodon.social/@riffraff/113503953295615142, mentioned on https://newsletter.shortruby.com/p/edition-115
MRI does not have a separate
Range#sum
method, so it looks like it is shortcutted inEnumerable#range
.