New answers tagged

1 vote

High throughput Fizz Buzz

Node JS (v18.1.0) ...
user avatar
  • 111
2 votes

High throughput Fizz Buzz

Here's my attempt with Node.js 18.4 Initial solution ...
user avatar
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 ...
user avatar
  • 21
3 votes

Generate Fibonacci Primes Quickly

C + PARI/GP's C library, \$F_{9677}\$ in 25s on my computer ...
user avatar
  • 34.8k
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 ...
user avatar
  • 41
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 ...
user avatar
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 ...
user avatar
  • 121
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 ...
user avatar
  • 141
1 vote

High throughput Fizz Buzz

PHP (simple) ...
user avatar
3 votes

High throughput Fizz Buzz

Can you check my version in rust ? On my laptop it seems faster than @aiden version ...
user avatar
4 votes

Write a FAST word equation solver

C++, 10000× faster (~20 µs) ...
user avatar
  • 659

Top 50 recent answers are included