Brandon Lucas
42fef80a47
Add benchmarks comparing Lux against 7 languages: - Rust, C, Go (compiled) - Node.js, Bun (JavaScript JIT) - Python (interpreted) Benchmarks: - Fibonacci (fib 35): recursive function calls - Prime counting (10k): loops and conditionals - Sum loop (10M): tight numeric loops - Ackermann (3,10): deep recursion - Selection sort (1k): sorting algorithm - List operations (10k): map/filter/fold with closures Results show Lux: - Matches C and Rust performance - 2-5x faster than Go - 7-15x faster than Node.js - 10-285x faster than Python Co-Authored-By: Claude Opus 4.5 <noreply@anthropic.com>
18 lines
323 B
C
18 lines
323 B
C
// Sum loop benchmark - tight numeric loop
|
|
#include <stdio.h>
|
|
#include <stdint.h>
|
|
|
|
int64_t sum_to(int64_t n) {
|
|
int64_t acc = 0;
|
|
for (int64_t i = 1; i <= n; i++) {
|
|
acc += i;
|
|
}
|
|
return acc;
|
|
}
|
|
|
|
int main() {
|
|
int64_t result = sum_to(10000000);
|
|
printf("Sum to 10M: %ld\n", result);
|
|
return 0;
|
|
}
|