Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Add benchmarks #52

Open
harrysarson opened this issue May 28, 2019 · 0 comments
Open

Add benchmarks #52

harrysarson opened this issue May 28, 2019 · 0 comments

Comments

@harrysarson
Copy link
Owner

I think we can at least double the speed of the near prime searching.

  • Use -O3.
  • Use two (or more) threads.

But first we need a benchmark or two so we know how much faster we are actually getting if we make these changes.

@harrysarson harrysarson mentioned this issue May 28, 2019
6 tasks
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant