# Benchmark game challenge and some optimization questions

**URL:** <https://discourse.julialang.org/t/benchmark-game-challenge-and-some-optimization-questions/79653>\
**Category:** Performance\
**Created:** [April 18, 2022, 8:16pm UTC](https://discourse.julialang.org/t/benchmark-game-challenge-and-some-optimization-questions/79653 "2022-04-18T20:16:04Z")\
**Posts on this page:** 1\
**Showing post:** 14

<div class="post-metadata">

**Author:** ![Palli](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/palli/32/3380_2.png) [@Palli](https://discourse.julialang.org/u/Palli)\
**Post date:** [April 26, 2022, 10:34pm UTC](https://discourse.julialang.org/t/benchmark-game-challenge-and-some-optimization-questions/79653/14 "2022-04-26T22:34:49Z")

</div>

See also Julia’s own: [Julia Micro-Benchmarks](https://julialang.org/benchmarks/)

It really needs be be rerun and updated (not done since 1.0), e.g. before 1.8 released. And if anything in Julia can be fixed for those or Debian’s benchmarks to make batter that would be great! Note, both have a pi benchmark, while very different.

> **[Translating the Julia Benchmarks into Cython (part 1)](https://schneider.hashnode.dev/julia-cython-benchmarks-1)**
>
> Hi everyone! 👋
> If you've ever heard anything about the
> Julia programming language, you probably heard that it
> is fast. They've got some pretty
> impressive microbenchmarks on their website
> to show this. In comparison, the
> Python programming language...

Note, also this discussion (and adding memory pools as a package, I’m not sure Debian will allow that, maybe if ithe the standard library?):

> [@Does Debian's BenchmarkGames show representative performance?](https://discourse.julialang.org/t/does-debians-benchmarkgames-show-representative-performance/80018/19):
>
> @palli and I did some binary tree tests recently measuring influence of GC and startup times. With the MWE using BenchmarkTools struct Node l::Union{Node,Nothing} r::Union{Node,Nothing} end function make(n) n === 0 ? Node(nothing, nothing) : Node(make(n - 1), make(n - 1)) end function check(node) node.l === nothing ? 1 : 1 + check(node.l) + check(node.r) end function binary\_trees(io, n) write(io, "stretch tree of depth $(n+1)\t check: $(check(make(n+1)))\n") long\_tr…

---

_[View the full topic](https://discourse.julialang.org/t/benchmark-game-challenge-and-some-optimization-questions/79653)._