Each item is a fast code optimization challenges example providing Original code, Optimized code, Tests, Benchmark input, Max allowed relative runtime. Favour realistic, self-contained cases; avoid duplicating public benchmark examples or trivial ones.
Secured after final acceptance. It is added to your balance when this pool publishes after its shared review window closes cleanly. Rejected items do not qualify.
Platform-authored spec, open on delivery.
Measured pipeline stats for this dataset. A dash means the platform does not publish that measure for this pool.
Illustrative samples authored for the Performance / Optimization Pairs dataset type.
def fib(n, memo=None):
if n <= 1:
return n
return fib(n-1) + fib(n-2)
def fib(n, memo=None):
if memo is None:
memo = {}
if n <= 1:
return n
if n in memo:
return memo[n]
memo[n] = fib(n-1, memo) + fib(n-2, memo)
return memo[n]
30
Approved public samples for this Performance / Optimization Pairs dataset. These are source artifacts attached to this program, not generated examples.