2.7 KiB
2.7 KiB
Coding Capabilities Test Results
Highscores
Performance Rankings (Duration)
| Test | Model | Duration (ms) | Duration (s) |
|---|---|---|---|
| simple_function | openrouter/quasar-alpha | 1425 | 1.43 |
| factorial_function | openrouter/quasar-alpha | 948 | 0.95 |
| fibonacci_function | openrouter/quasar-alpha | 1287 | 1.29 |
Summary
- Total Tests: 3
- Passed: 0
- Failed: 3
- Success Rate: 0.00%
- Average Duration: 1220ms (1.22s)
Failed Tests
simple_function - openrouter/quasar-alpha
- Prompt:
Generate a JavaScript function that adds two numbers and returns the result. The function should be named 'add' and take two parameters 'a' and 'b'. Return only the function code, no explanation. - Expected:
function add(a, b) { return a + b; } - Actual:
function add(a, b) { return a + b; } - Duration: 1425ms (1.43s)
- Reason: Expected function add(a, b) { return a + b; }, but got function add(a, b) { return a + b; }
- Timestamp: 4/4/2025, 2:52:19 PM
factorial_function - openrouter/quasar-alpha
- Prompt:
Generate a JavaScript function that calculates the factorial of a number. The function should be named 'factorial' and take one parameter 'n'. Return only the function code, no explanation. - Expected:
function factorial(n) { return n <= 1 ? 1 : n * factorial(n - 1); } - Actual:
function factorial(n) { if (n === 0 || n === 1) { return 1; } return n * factorial(n - 1); } - Duration: 948ms (0.95s)
- Reason: Expected function factorial(n) { return n <= 1 ? 1 : n * factorial(n - 1); }, but got function factorial(n) { if (n === 0 || n === 1) { return 1; } return n * factorial(n - 1); }
- Timestamp: 4/4/2025, 2:52:20 PM
fibonacci_function - openrouter/quasar-alpha
- Prompt:
Generate a JavaScript function that calculates the nth Fibonacci number. The function should be named 'fibonacci' and take one parameter 'n'. Return only the function code, no explanation. - Expected:
function fibonacci(n) { return n <= 1 ? n : fibonacci(n - 1) + fibonacci(n - 2); } - Actual:
function fibonacci(n) { if (n <= 0) return 0; if (n === 1) return 1; let a = 0, b = 1; for (let i = 2; i <= n; i++) { let temp = a + b; a = b; b = temp; } return b; } - Duration: 1287ms (1.29s)
- Reason: Expected function fibonacci(n) { return n <= 1 ? n : fibonacci(n - 1) + fibonacci(n - 2); }, but got function fibonacci(n) { if (n <= 0) return 0; if (n === 1) return 1; let a = 0, b = 1; for (let i = 2; i <= n; i++) { let temp = a + b; a = b; b = temp; } return b; }
- Timestamp: 4/4/2025, 2:52:22 PM
Passed Tests
No passed tests