New answers tagged fastest-code
1
vote
2
votes
2
votes
High throughput Fizz Buzz
Go
Compile and run with go run main.go
Some notes:
Creates output in 15-line templates where possible.
Divides work into sections of lines with same base10 integer ...
3
votes
Generate Fibonacci Primes Quickly
C + PARI/GP's C library, \$F_{9677}\$ in 25s on my computer
...
1
vote
Generate Fibonacci Primes Quickly
Wolfram Language (Mathematica), F9677 in <1 s
PrimeQ[(MatrixPower[{{1,1},{1,0}},#].{1,0})[[2]]]&
Try it online!
If you are looking for fast code, then I ...
7
votes
Generate Fibonacci Primes Quickly
Rust, \$F_{14431}\$ in ≈ 58 s
(Unofficial estimate based on the expected CPU performance ratio.)
After special-casing \$F_3, F_4\$, this tests every prime-indexed Fibonacci number with the GMP ...
2
votes
High throughput Fizz Buzz
I'm surprised there is no JavaScript answer here.
But when I try to write a solution, I think I understand why.
JavaScript's score are pretty bad, and the very uncertainty.
But anyway, I want to ...
4
votes
High throughput Fizz Buzz
Did answer with Go, got my Dell 5560 2.35G but please test with your system. 12 threads(routines in go terms) was best with this 8 core 2 threads per core cpu but please test other numbers too as it ...
1
vote
3
votes
High throughput Fizz Buzz
Can you check my version in rust ? On my laptop it seems faster than @aiden version
...
4
votes
Top 50 recent answers are included
Related Tags
fastest-code × 182math × 44
combinatorics × 31
code-challenge × 22
sequence × 17
number × 16
primes × 14
number-theory × 13
string × 12
code-golf × 7
integer × 7
grid × 7
optimization × 7
game × 6
geometry × 5
permutations × 5
matrix × 4
binary × 4
sorting × 4
python × 4
puzzle-solver × 4
board-game × 4
array × 3
arithmetic × 3
restricted-source × 3