Compare Qwen3 Coder Flash by Qwen against Aurora Alpha by OpenRouter, context windows of 128K vs 128K, tested across 50 shared challenges. Updated February 2026.
45 challenges
Tests an AI's ability to make educated estimates based on technical knowledge
Step‑by‑step back‑of‑the‑envelope estimate
Below is a simple calculation that uses only publicly‑known high‑level facts about GPT‑3 (size of the model, length of the training data, and the basic arithmetic cost of a Transformer layer).
All numbers are rounded to make the math easy to follow; the goal is to get an order‑of‑magnitude figure rather than an exact count.
| Property | Approximate value |
|---|---|
| Number of parameters (the “175 B” model) | 1.75 × 10¹¹ |
| Hidden dimension d (the size of each token representation) | ≈ 12 288 |
| Number of Transformer layers L | 96 |
| Feed‑forward inner dimension dff* (usually 4 × d) | ≈ 49 152 |
| Size of the training corpus (tokens) | ≈ 3 × 10¹¹ tokens (≈ 300 B) |
| Training uses Adam‑style optimizer, mixed‑precision, etc. – we ignore those details for the FLOP count. |
These numbers are taken from the model card and the paper; they are the only “hard” data we need.
A standard Transformer layer consists of two main sub‑blocks:
| Sub‑block | Main operations (per token) | Approx. FLOPs |
|---|---|---|
| Self‑attention (Q, K, V projections + attention scores + weighted sum) | 3 × d × d (proj) + d × d (QK) + d × d (AV) | ≈ 5 × d² |
| Feed‑forward (two linear layers, activation in between) | d × d _ff + d × d × 4 (first linear) + 4 × d × d (second linear) | ≈ 8 × d² |
Summing them gives roughly
[ \text{FLOPs per token per layer} ;\approx; (5+8),d^{2}=13,d^{2}. ]
Why the factor 13?
[ d = 12,288 \quad\Rightarrow\quad d^{2} \approx 1.51\times10^{8}. ]
[ 13,d^{2} \approx 13 \times 1.51\times10^{8} \approx 1.96\times10^{9};\text{FLOPs per token per layer}. ]
[ \text{FLOPs per token (forward pass)} = L \times 13,d^{2} \approx 96 \times 1.96\times10^{9} \approx 1.88\times10^{11}. ]
So a single forward pass of one token through the full 96‑layer model costs ≈ 2 × 10¹¹ FLOPs.
[ \text{Tokens processed} = 3\times10^{11}. ]
[ \text{Forward FLOPs total} = 3\times10^{11} \times 1.88\times10^{11} \approx 5.6\times10^{22}. ]
During training we must compute gradients. A common rule of thumb is that the backward pass costs about 2 × the forward pass, so the total compute (forward + backward) is roughly 3 × the forward cost.
[ \text{Total training FLOPs} \approx 3 \times 5.6\times10^{22} \approx 1.7\times10^{23}. ]
[ \boxed{\text{≈ 10^{23}\ \text{FLOPs (a few × 10^{23})}} ]
In words: training the 175‑billion‑parameter GPT‑3 model required on the order of a hundred sextillion floating‑point operations.
This figure is consistent with the “exascale” compute budgets that have been reported for the largest language‑model training runs.
| Source of error | Effect on the estimate |
|---|---|
| Exact token count (the corpus size is reported as 300 B but the actual number of training steps may be slightly higher) | ± 10 % |
| The factor 13 for FLOPs per layer is a simplification (real implementations have extra ops for layer‑norm, bias terms, dropout, etc.) | + ~ 20 % |
| Mixed‑precision training reduces FLOPs for some operations, but the count above assumes full‑precision arithmetic | – ~ 10 % |
| Over‑head from optimizer state updates, gradient accumulation, checkpointing, etc. | + ~ 10 % |
Even allowing for these variations, the estimate stays within 10²³ – 10²⁴ FLOPs, i.e. a few hundred exa‑FLOPs.
Bottom line: Using only the model’s size, the number of layers, and the token count, a straightforward arithmetic model yields a total training compute on the order of 10²³ floating‑point operations for GPT‑3. This is the magnitude of compute that modern “large‑scale” language models demand.
Tests an AI's ability to understand game rules and strategy
Tests an AI's ability to solve a simple but potentially confusing logic puzzle
Sally has one sister.
Reasoning
Thus the total number of sisters in the family is 2. One of those sisters is Sally, leaving one other sister for her. So Sally has one sister.
Tests an AI's randomness and creativity
Here are five jokes for you:
Why did the scarecrow win an award?
Because he was outstanding in his field!
What do you call fake spaghetti?
An impasta.
Why don’t scientists trust atoms?
Because they make up everything.
How does a penguin build its house?
Igloos it together.
What’s orange and sounds like a parrot?
A carrot.
How many are unique?
All five jokes are distinct, so there are 5 unique jokes.
Tests an AI's ability to generate vector graphics
Tests an AI's ability to create detailed SVG illustrations of gaming hardware
Tests an AI's humor and creative writing ability
[Opening – 0:00‑0:30]
Hey, everyone! Great to see you all here tonight. I just got back from a week of “working from home,” which is a fancy way of saying my cat now thinks I’m a permanent fixture on the couch. She’s started charging me rent—she’s got a little bowl of kibble on the coffee table and a sign that says “No humans beyond this point.” I’m not sure if she’s being demanding or just trying to get me to finally stop pretending I’m a professional chef.
[The “Fitness” Saga – 0:30‑1:15]
Speaking of professional chef, I tried a new fitness app that promises “personalized workouts.” The first day it asked me, “What’s your goal?” I said, “I want to be able to lift the grocery bag without groaning.” The app replied, “Great! Let’s start with a 5‑minute warm‑up.” Five minutes later I was on the floor, questioning every life choice that led me to this point. The app then suggested a “quick stretch.” I stretched my patience, my budget, and my belief that I could ever be a “runner.” The only thing I ran was out of time for a proper nap.
[Zoom Meetings – 1:15‑2:00]
Zoom has become the new office. The best part? You can wear a suit on the top and pajamas on the bottom, and no one will ever know. The worst part? The “mute” button. I’ve been muted so many times I’m convinced my boss thinks I’m a mime. One day I tried to speak up about a project, and the whole team heard the sound of my cat knocking over a plant. I think the plant was more articulate than I am. And there’s always that one person who forgets to turn off their background. I’ve seen a beach, a spaceship, and a very convincing replica of a 1970s kitchen—all while they’re discussing quarterly earnings. I’m waiting for the day someone shows up with a live marching band in the background. That would be the ultimate “I’m not paying attention” signal.
[Grocery Store Adventures – 2:00‑2:45]
I went to the grocery store the other day and realized it’s basically a social experiment. The “express lane” is a myth. I stood there for ten minutes while someone in front of me tried to decide if a single avocado was “ripe enough.” Meanwhile, the person behind me was silently judging my choice of cereal—because apparently, buying “Chocolate Cheerios” is a statement about my life choices. And then there’s the “self‑checkout.” I’m convinced the machine is secretly judging me. Every time I scan an item, it beeps like it’s saying, “Really? Another bag of chips? You’ve got a whole pantry, buddy.” I tried to scan a banana, and it refused, insisting I needed a “fruit‑to‑human interaction” license.
[Closing – 2:45‑3:00]
So, here’s the takeaway: life is a series of tiny, absurd moments that we all pretend to have under control. Whether it’s a cat demanding rent, a fitness app that thinks I’m a superhero, or a Zoom call that could double as a theater production, the best we can do is laugh at the chaos. Thanks for letting me share my stories—now go out there and make sure your cat doesn’t start charging you rent. Good night!
Tests an AI's ability to simulate personalities and predict future trends
Tests an AI's humor and understanding of current events
Tests an AI's ability to write in distinct character voices
Tests an AI's ability to generate a complete, working landing page
Couldn't render this response
This model didn't return a displayable web page for this challenge.
```
Recreate an interactive, nostalgic Pokémon battle UI in a single HTML file.
