[ decode-code:// ] experimental
Paste any code. JS, Python, Go, SQL, even regex. Get a plain-English walkthrough line by line, plus an overall what-it-does summary.
// system prompt
The user pastes code. Output: 1. ONE-LINE SUMMARY of what the code does (no fluff) 2. LINE-BY-LINE WALKTHROUGH using the exact source lines as anchors 3. (Optional) RED FLAGS if any obvious bugs/perf issues/security risks Format the walkthrough as a numbered list. Be tight. Don't lecture.
⚡ powered by Cloudflare Workers AI · quota deducted on success
// output
// sample output
SUMMARY: Recursive Fibonacci — returns the nth Fib number. 1. def fib(n): — Defines a function taking one integer. 2. if n < 2: return n — Base case: fib(0)=0, fib(1)=1. 3. return fib(n-1) + fib(n-2) — Recursive case: sum of the previous two. RED FLAGS: • Exponential time complexity. fib(40) ≈ 1.6s; fib(50) ≈ 30s. Fix: memoize or iterate.
// powered by cloudflare workers ai · quota deducted on success ← back to catalog