Sunday 6 September 2026 Rebuilt nightly from the WCA's official results · export of 6 September 2026 · About
The Middle Three
People → Austria → Thomas Heiden

People · Austria

Thomas Heiden

3×3 · top 0.34% of 284,439 all-time · competing since June 2019 · 2019HEID03

Thomas Heiden has been competing for 7 years. His best event is the 3×3: a personal-best single of 5.72, set at Cubing in Ružinov: January 2025, puts him in the top 0.34% of the 284,439 people who have ever been ranked in the event, and 4th in Austria. Until June 2011, no official 3×3 solve in the world had been that fast. Across 45 competitions since June 2019, he has put 2,992 official solves on the record across 17 events. Solve to solve, his 3×3 times vary about 15% around a typical one; 85% of the 35,811 competitors with ten or more counted rounds hold a tighter spread. His 3×3 best has come down from 21.50 in June 2019 to 5.72, a 73% improvement. Thomas has entered 45 competitions, more competitions than 99% of everyone who has ever competed.

3×3
best event — top 0.34% of 284,439 all-time
5.72
signature single · Cubing in Ružinov: January 2025
2,992
official solves on the record
15%
solve-to-solve spread · wider than 85% of the field

Standing, event by event

vs everyone ever ranked
EventPB singlePB averageAll-time standingAustria
3×35.727.98
top 0.34%4 / 530
Pyraminx1.662.47
top 0.62%3 / 261
2×21.091.63
top 0.75%4 / 396
Skewb1.833.70
top 0.97%1 / 161
Clock3.514.80
top 1.5%1 / 79
3×3 one-handed10.7514.44
top 1.6%2 / 184
4×428.3629.74
top 1.9%5 / 224
Megaminx43.3250.59
top 2.5%2 / 93
5×552.911:01.16
top 2.6%4 / 118
Square-17.7911.41
top 2.7%1 / 73
3×3 blindfolded29.031:00.14
top 3.9%5 / 36
3×3 Fewest Moves24 moves32.00
top 4.0%2 / 53
6×61:46.431:52.88
top 5.9%5 / 64
7×73:02.443:09.91
top 11.2%8 / 53
4×4 blindfolded6:29.26—
top 33.2%8 / 12
3×3 Multi-Blind6 of 6 cubes · 52:01—
top 33.4%11 / 17
5×5 blindfolded21:56.00—
early days — 2 solves9 / 10

Percentile against all competitors ever ranked in each event, a fairer measure than raw rank, because the pools differ by a factor of ten.

The line so far

Rhein-Neckar Open 2019: 21.50Slovakian Summer 2019: 20.04Frankfurt Cube Days 2020: 12.98Project Pawłowice 2021: 11.09Rhein-Neckar Open B 2021: 11.46Speedcubing i Lille Friheden 2022: 8.76Lake Constance Cubing 2022: 8.83Luxembourg Open 2022: 8.82Mallorca Open 2022: 7.31Lužice Open 2022: 7.96Speedcubing Slovakia 2022: 9.30Prague Open 2022: 9.44Bretzel Open 2023: 8.20Baden Basic & Beginners 2023: 7.92Vienna Big Cube Summer 2023: 7.26Lužice Summer 2023: 7.66Rheinland-Pfalz Open 2023: 7.73Dolné Orešany Cube Day 2023: 7.28Bavarian Open 2023: 6.71Cubing in HD 2024: 7.55Warm Up Portugalete 2024: 7.99Rubik's WCA European Championship 2024: 8.53Slovak Nationals 2024: 7.76Luxembourg Nationals 2024: 8.08Vienna Autumn 2024: 6.86Lužice Winter 2024: 7.59Cubing in Ružinov: January 2025: 5.72Nitra Open 2025: 7.75Vienna Fasching 2025: 6.42Langenstein City Blind Open 2025: 7.99Linz Summer 2025: 7.11Slovak Championship 2025: 6.74Champagne Open 2025: 7.43Visé Saturday Open 2025: 6.45Vienna Autumn 2025: 6.48Leuven Open 2026: 7.88Cubing in Ružinov: March 2026: 6.66Budapest Open 2026: 6.88Vienna Frühling 2026: 6.40Warm Up Lent 2026: 6.82Rubik's WCA European Championship 2026: 7.50Langenstein Summer 2026: 6.245.7221.5022 Jun 201922 Aug 2026

Best single per competition, 3×3. Faster is higher — the axis is the right way up.

The story so far

Competitions

Reading this page: a single is one solve's time · an average is the middle three of five solves, best and worst discarded · a PB is a personal best · a DNF (did not finish) is an attempt with no valid result: a popped piece, an unsolved face, an over-limit memorisation · top X% compares against everyone ever ranked in that event, which is fairer than raw rank because event pools differ tenfold.

The circuit

The people whose scorecards keep turning up next to his.

Next targets

  • A sub-5 3×3 single — 344 people have one; it is 0.72 away.
  • A sub-1 Pyraminx single — 49 people have one; it is 0.66 away.

Targets move as he improves.