rad-experiment show dc56f1a4e4c826eb2af69b84e16d692073b17927
by vagrant · Apr 1 08:45 2026
Sum identity F(n+1)-1 eliminates summation loop
Delta-0.00%
Metricduration (ms)
Criterialower_is_better
LOC+6-4
Kept Discarded Running best
Measurements
Metric
Baseline
Candidate
Delta
duration (ms)How long the code takes to run. Less is better.
0.000 ms (n=5)
0.000 ms (n=5)
-0.00%
p95 (ms)Measures p95 in ms. Less is better.
0.000 ms
0.000 ms
-0.00%
ops_per_sec (ops/sec)Operations completed per second. More is better.
1848429.880 ops/sec
2178647.010 ops/sec
+17.86%
Diff
~ src/index.ts
@@ -1,19 +1,21 @@
1 /**
2 * Compute the sum of the first `n` Fibonacci numbers.
3 *
4+ * Uses the identity: sum(F(0)..F(n-1)) = F(n+1) - 1
5 * For n = 30, the expected result is 1,346,268.
6 */
7 export function sumFibonacci(n: number): number {
7- let sum = 0;
8+ if (n <= 0) return 0;
9+
10+ // Compute F(n+1) iteratively
11 let a = 0;
12 let b = 1;
10-
13 for (let i = 0; i < n; i++) {
12- sum += a;
14 const next = a + b;
15 a = b;
16 b = next;
17 }
1818- return sum;
19+ // sum(F(0)..F(n-1)) = F(n+1) - 1
20+ return b - 1;
21 }