CodSpeedHQ
codspeed-rust
Blog
Docs
Changelog
Blog
Docs
Changelog
Overview
Branches
Benchmarks
Runs
GitHub Actions run
Wall Time
Uses the
Wall Time instrument
to collect wall time performance metrics.
8 months ago
9114511
main
push
Compare
Base
Search a run
Head
main
9114511
8 months ago
Wall Time
Compare
Suggested base runs:
Parent Commit
Benchmarks
Recursive[20]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3
50.4 µs
iter_batched_large_input
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
< 1 ns
iter_with_large_drop
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
< 1 ns
from_elem[2048]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
248 ns
Flat
crates/criterion_compat/benches/criterion_integration/sampling_mode.rs::benches::sampling_mode_tests::sampling_mode
10.1 ms
build_vec
crates/criterion_compat/benches/criterion_example.rs::benches::b
195 ns
"*benchmark/" '
crates/criterion_compat/benches/criterion_integration/special_characters.rs::benches::some_benchmark::"*group/"
< 1 ns
iter_batched_ref_large_input
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
< 1 ns
from_elem_decimal[1024]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
81 ns
from_elem[8192]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
493 ns
sum_fold
crates/criterion_compat/benches/criterion_example.rs::benches::a
304 ns
Auto
crates/criterion_compat/benches/criterion_integration/sampling_mode.rs::benches::sampling_mode_tests::sampling_mode
3 ns
iter_with_large_setup
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
< 1 ns
from_elem_decimal[2048]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
247 ns
from_elem[1024]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
81 ns
Iterative
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis::Fibonacci
21 ns
Recursive
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis::Fibonacci
50.4 µs
Recursive[21]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3
81.5 µs
large_drop
crates/criterion_compat/benches/criterion_integration/iter_with_large_drop.rs::benches::large_drop::iter_with_large_drop
175 µs
Iterative[20]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3
21 ns
small_setup
crates/criterion_compat/benches/criterion_integration/iter_with_large_setup.rs::benches::small_setup::iter_with_large_setup
1 ns
with_input[5]
crates/criterion_compat/benches/test_benches.rs::benches::bench_with_explicit_lifetime
< 1 ns
iter_batched_small_input
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
< 1 ns
with_input[5]
crates/criterion_compat/benches/test_benches.rs::benches::nested::bench
< 1 ns
large_setup
crates/criterion_compat/benches/criterion_integration/iter_with_large_setup.rs::benches::large_setup::iter_with_large_setup
12 ns
iter_batched_ref_small_input
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
< 1 ns
iter
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
< 1 ns
small_drop
crates/criterion_compat/benches/criterion_integration/iter_with_large_drop.rs::benches::small_drop::iter_with_large_drop
< 1 ns
fibonacci_custom_measurement
crates/criterion_compat/benches/criterion_integration/custom_measurement.rs::benches::fibonacci_cycles
407 ns
iter_with_setup
crates/criterion_compat/benches/criterion_integration/iter_with_setup.rs::benches::setup
40 ns
Iterative[21]
crates/criterion_compat/benches/criterion_integration/compare_functions.rs::fibonaccis::compare_fibonaccis_group::Fibonacci3
22 ns
iter_with_setup
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
40 ns
bench_explicit_measurement
crates/criterion_compat/benches/test_benches.rs::benches::bench_using_group_with_explicit_measurement::group
< 1 ns
iter_batched_ref_per_iteration
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
40 ns
from_elem[4096]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
339 ns
with_input[5]
crates/criterion_compat/benches/test_benches.rs::benches::bench
< 1 ns
Linear
crates/criterion_compat/benches/criterion_integration/sampling_mode.rs::benches::sampling_mode_tests::sampling_mode
3 ns
from_elem[16384]
crates/criterion_compat/benches/criterion_integration/with_inputs.rs::benches::from_elem
819 ns
iter_batched_per_iteration
crates/criterion_compat/benches/criterion_integration/measurement_overhead.rs::benches::some_benchmark::overhead
40 ns
iterative[5]
crates/divan_compat/examples/benches/math.rs::fibonacci
8.3 ns
graph_coloring[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1.2 µs
mul
crates/divan_compat/examples/benches/math.rs
2.6 ns
knight_tour[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
249 ms
subset_sum[10]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
998 ns
tsc (aarch64)
crates/divan_compat/examples/benches/time.rs::duration_since
< 1 ns
permutations[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
803 µs
add_two_integers[(0, 0)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
5.5 ns
find_highest_set_bit[255]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
5.7 ns
recursive_memoized[HashMap<u64, u64>, 20]
crates/divan_compat/examples/benches/math.rs::fibonacci
3.3 µs
recursive[20]
crates/divan_compat/examples/benches/math.rs::fibonacci
47.3 µs
hamiltonian_cycle[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
578.1 ns
generate_gray_code[2]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
234.6 ns
tsc (aarch64)
crates/divan_compat/examples/benches/time.rs::now
3.1 ns
recursive[30]
crates/divan_compat/examples/benches/math.rs::fibonacci
5.8 ms
instant
crates/divan_compat/examples/benches/time.rs::duration_since
10.1 ns
iterative[10]
crates/divan_compat/examples/benches/math.rs::fibonacci
16.7 ns
find_highest_set_bit[0]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
5.7 ns
subset_sum[12]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1.9 µs
n_queens_solver[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
534.3 µs
iterative[0]
crates/divan_compat/examples/benches/math.rs::fibonacci
1.7 ns
find_highest_set_bit[42]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
5.7 ns
sort_unstable
crates/divan_compat/examples/benches/sort.rs::sorted
130.5 µs
generate_combinations[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
3.7 µs
recursive_memoized[BTreeMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci
497.1 ns
knight_tour[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
292.3 ms
hamiltonian_cycle[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
633.6 ns
count_set_bits[255]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
13.6 ns
add_two_integers[(255, 255)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
19.5 ns
generate_parentheses[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
2.3 µs
add_two_integers[(1024, -1024)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
65.9 ns
system_time
crates/divan_compat/examples/benches/time.rs::duration_since
12.8 ns
add_two_integers[(65535, -65535)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
74.7 ns
find_highest_set_bit[65535]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
5.7 ns
subset_sum[16]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
4 µs
generate_parentheses[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
68.2 µs
hamiltonian_cycle[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
815.1 ns
system_time
crates/divan_compat/examples/benches/time.rs::now
39.1 ns
knight_tour[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
8.6 ms
hamiltonian_cycle[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
726.6 ns
div
crates/divan_compat/examples/benches/math.rs
3.5 ns
generate_parentheses[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
21.8 µs
sleep_1us
crates/divan_compat/examples/benches/time_scale.rs
16.2 µs
recursive_memoized[BTreeMap<u64, u64>, 0]
crates/divan_compat/examples/benches/math.rs::fibonacci
14.5 ns
recursive_memoized[HashMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci
5.7 µs
generate_combinations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
815 ns
rem
crates/divan_compat/examples/benches/math.rs
3.5 ns
add
crates/divan_compat/examples/benches/math.rs
2.6 ns
find_highest_set_bit[1024]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
5.7 ns
permutations[3]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
731 ns
n_queens_solver[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
22.4 µs
iterative[20]
crates/divan_compat/examples/benches/math.rs::fibonacci
39.2 ns
recursive[10]
crates/divan_compat/examples/benches/math.rs::fibonacci
384.6 ns
n_queens_solver[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
7.8 µs
add_two_integers[(42, 13)]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
19.5 ns
instant
crates/divan_compat/examples/benches/time.rs::now
39.1 ns
count_set_bits[0]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
13.6 ns
recursive_memoized[BTreeMap<u64, u64>, 30]
crates/divan_compat/examples/benches/math.rs::fibonacci
2.8 µs
graph_coloring[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1 µs
generate_gray_code[3]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
449.1 ns
recursive_memoized[BTreeMap<u64, u64>, 20]
crates/divan_compat/examples/benches/math.rs::fibonacci
1.7 µs
permutations[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
13.8 µs
sort_unstable
crates/divan_compat/examples/benches/sort.rs::random
3.3 ms
count_set_bits[65535]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
13.6 ns
sleep_1ms
crates/divan_compat/examples/benches/time_scale.rs
1.1 ms
generate_gray_code[5]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
1.9 µs
recursive_memoized[HashMap<u64, u64>, 10]
crates/divan_compat/examples/benches/math.rs::fibonacci
1.5 µs
graph_coloring[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
914 ns
recursive[5]
crates/divan_compat/examples/benches/math.rs::fibonacci
31.8 ns
knight_tour[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
294.8 µs
generate_combinations[9]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
4.3 µs
generate_gray_code[1]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
130.8 ns
count_set_bits[42]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
13.6 ns
generate_combinations[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1.3 µs
sort
crates/divan_compat/examples/benches/sort.rs::random
4.8 ms
sort
crates/divan_compat/examples/benches/sort.rs::sorted
116.5 µs
subset_sum[14]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
2 µs
sudoku
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
107.7 µs
n_queens_solver[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
126 µs
recursive_memoized[BTreeMap<u64, u64>, 5]
crates/divan_compat/examples/benches/math.rs::fibonacci
182.1 ns
n_queens_solver[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1.6 µs
count_set_bits[1024]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
13.6 ns
recursive_memoized[HashMap<u64, u64>, 0]
crates/divan_compat/examples/benches/math.rs::fibonacci
15.8 ns
sleep_100us
crates/divan_compat/examples/benches/time_scale.rs
146.8 µs
graph_coloring[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
1.1 µs
generate_gray_code[4]
crates/divan_compat/examples/benches/the_algorithms.rs::bit_manipulation
899 ns
generate_combinations[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
2 µs
print_env_hello
crates/divan_compat/examples/benches/env.rs
2 µs
subset_sum[18]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
4.1 µs
permutations[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
70.2 µs
generate_parentheses[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
6.8 µs
recursive_memoized[HashMap<u64, u64>, 5]
crates/divan_compat/examples/benches/math.rs::fibonacci
573.6 ns
iterative[30]
crates/divan_compat/examples/benches/math.rs::fibonacci
51.3 ns
rat_in_maze[6]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
740 ns
sleep_100ns
crates/divan_compat/examples/benches/time_scale.rs
18.8 µs
permutations[4]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
2.4 µs
fibo_50
crates/divan_compat/benches/basic_example.rs
2.2 ns
init_array[42]
crates/divan_compat/benches/basic_example.rs::const_bench
51.3 ns
bench_array1[4]
crates/divan_compat/benches/basic_example.rs::const_bench
3.8 ns
mut_borrow
crates/divan_compat/benches/basic_example.rs
7.9 ns
bench_array2[10]
crates/divan_compat/benches/basic_example.rs::const_bench
10.1 ns
fibo_10
crates/divan_compat/benches/basic_example.rs
2.2 ns
init_array[4]
crates/divan_compat/benches/basic_example.rs::const_bench
3.8 ns
bench_array1[1]
crates/divan_compat/benches/basic_example.rs::const_bench
1.8 ns
bench_array1[10]
crates/divan_compat/benches/basic_example.rs::const_bench
10.1 ns
bench_array2[1]
crates/divan_compat/benches/basic_example.rs::const_bench
1.8 ns
bench_array2[4]
crates/divan_compat/benches/basic_example.rs::const_bench
3.8 ns
bench_array2[42]
crates/divan_compat/benches/basic_example.rs::const_bench
52.2 ns
init_array[1000]
crates/divan_compat/benches/basic_example.rs::const_bench
1.8 µs
bench_array1[42]
crates/divan_compat/benches/basic_example.rs::const_bench
51.3 ns
Ignored
rat_in_maze[8]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
Ignored
932 ns
sleep_1ns
crates/divan_compat/examples/benches/time_scale.rs
Ignored
19.4 µs
recursive[0]
crates/divan_compat/examples/benches/math.rs::fibonacci
Ignored
2.2 ns
rat_in_maze[5]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
Ignored
606.6 ns
rat_in_maze[7]
crates/divan_compat/examples/benches/the_algorithms.rs::backtracking
Ignored
824 ns
© 2025 CodSpeed Technology
Home
Terms
Privacy
Docs