Quantitative Code Conflux: Techfest IIT Bombay's Jane Street Challenge
Quantitative Code Conflux: Jane Street's Coding and Quant Challenge at Techfest IIT Bombay
Most quant competitions ask you to pick a lane. The Quantitative Code Conflux (QCC) asks you to master two — and then combine them into a working system.
Hosted by Techfest, IIT Bombay — Asia's largest science and technology festival — and sponsored by Jane Street, the QCC is a national competition that starts as a competitive programming and quantitative reasoning contest, then transforms into a modular systems engineering challenge in the Grand Finale. It's one of the few competitions that tests both algorithmic problem‑solving and the ability to integrate independent components into a single working solution under time pressure.
If you've ever wanted to know what it feels like to build software the way a quant desk does — in pieces, against a clock, with everything depending on everything else — this is the closest thing to it.
What Is the Quantitative Code Conflux?
The QCC is a two‑stage competition:
- Round 1 — Algorithmic & Quantitative Contest: A single integrated contest split into two sections. Part A covers competitive programming; Part B covers quantitative reasoning. You can attempt questions in any order.
- Round 2 — Grand Finale: Modular Systems Challenge: An on‑site final where teams solve ten interconnected modules organised into three levels, progressing from independent components to a fully integrated system.
The progression is deliberate. Round 1 tests whether you can solve problems in isolation. Round 2 tests whether you can build something coherent out of them. That second skill is what separates a competitive programmer from an engineer — and it's exactly what quantitative trading firms look for.
The competition is sponsored by Jane Street, whose interview process is famous for combining algorithmic rigour with probabilistic reasoning. For a fuller picture of the firm, see our guide to the top quant firms and how to break in.
Who Can Enter?
| Requirement | Details |
|---|---|
| Eligibility | Open to all students with a valid ID from their educational institution |
| Team size | 1 to 3 members |
| Team composition | All members must belong to the same undergraduate or postgraduate institution |
| Registration | Required at techfest.org |
| Finals format | On‑site at IIT Bombay, Mumbai |
Note the team constraint: unlike some Techfest competitions where teams can span institutes, QCC requires all members to come from the same institution. Solo entry is permitted, so you don't need a team to register.
If you're weighing this against the National Probability Challenge — the other Jane Street‑sponsored Techfest competition — the key difference is scope. The NPC tests pure reasoning. The QCC tests reasoning and code and system integration. We've covered the NPC separately in our guide to the National Probability Challenge.
Round 1: Algorithmic & Quantitative Contest
Format
- Duration: 4 hours
- Platform: HackerEarth
- Structure: Two sections, attempt in any order
- Slots: Two slots, but each team attempts the contest only once
- Scoring: Full points only for complete solutions — no partial scoring
- Evaluation: Hidden test cases where applicable
Part A — Algorithmic Programming
Seven problems, with points scaling by difficulty:
| Problem | Topic | Points |
|---|---|---|
| A1 | Math + Brute Force | 100 |
| A2 | Two Pointers / Greedy | 200 |
| A3 | Implementation + Observation | 300 |
| A4 | Dynamic Programming | 500 |
| A5 | XOR / Bit Manipulation | 700 |
| A6 | Trees | 850 |
| A7 | Graphs | 1000 |
| Total | 3,650 |
Part B — Quantitative Reasoning
Mirrors Part A in both progression and weightage:
| Problem | Topic | Points |
|---|---|---|
| Q1 | Probability | 100 |
| Q2 | Combinatorics & Counting | 200 |
| Q3 | Expected Value | 300 |
| Q4 | Statistics & Data Interpretation | 500 |
| Q5 | Logic & Game Theory | 700 |
| Q6 | Mathematical Optimization | 850 |
| Q7 | Integrated Quantitative Challenge | 1000 |
| Total | 3,650 |
The symmetry is intentional. A total of 7,300 points is available, split evenly between the two halves. A team that's brilliant at algorithms but weak on probability will struggle to reach the top — and vice versa.
Ranking Methodology
Teams are ranked by a strict priority order:
- Number of problems solved
- Total points earned
- Time penalty (based on contest rules on the platform)
- Earliest final accepted submission, if required
Because ranking starts with count before points, solving many easy problems can outrank solving fewer hard ones. Strategy matters as much as raw ability.
Qualification
The top 20 teams from each slot — 40 teams total — advance to the Grand Finale.
Registration Rules That Trip People Up
The documentation is unusually explicit about this, so read carefully:
- Each participant registers on the Techfest website only once, either solo or as part of a team.
- A participant cannot be in more than one team. Violations mean disqualification.
- Each participant or team receives a unique Techfest ID, which can be used only once on HackerEarth.
- For team registrations, only the team leader should register on HackerEarth using the Techfest ID. If multiple members register with the same ID, the whole team is disqualified.
This is a hard rule with harsh consequences. Get it right the first time.
Round 2: The Grand Finale — Modular Systems Challenge
This is where the QCC diverges from a standard programming contest.
- Duration: 5 hours
- Platform: HackerEarth
- Structure: 10 modules across 3 levels
- Evaluation: Hidden test cases run automatically on each module and the final integrated system
- Scoring: No partial marking — a module scores only if completely solved
The Three Levels
| Level | Modules | Points per Module | Total |
|---|---|---|---|
| Foundation | 6 | 20 | 120 |
| Integration | 3 | 50 | 150 |
| Final System | 1 | 100 | 100 |
| Total | 10 | 370 |
Foundation Modules are independent. Each represents one component of the overall system, and they can be attempted in any order. Solve one, bank 20 points.
Integration Modules require combining multiple foundation modules. These test whether your components actually fit together — a very different skill from building them in isolation.
Final System Module requires integrating everything into one complete solution. The organisers are explicit about the goal: not merely to solve isolated problems, but to engineer a complete working solution under time constraints.
The Single‑Device Policy
One detail stands out more than any other:
In Round 2, only one laptop per team may be open and operational at a time.
The remaining members must collaborate offline within the continuous 5‑hour countdown. This fundamentally changes how a team operates. You can't parallelise by having three people coding simultaneously on three machines. You have to plan, divide roles, and coordinate — which means the team that wins is often the one that communicates best, not the one with the strongest individual coder.
That constraint is a deliberate design choice, and it's worth preparing for specifically.
How to Prepare
The QCC rewards breadth in Round 1 and engineering discipline in Round 2. That calls for a two‑track preparation strategy.
Round 1 — Part A (Algorithmic)
Cover the seven problem categories systematically. The point values tell you where the difficulty sits:
- Fundamentals (100–300): Brute force, two pointers, greedy, implementation, and observation. Don't skip these — they're fast points and ranking prioritises problems solved.
- Core techniques (500–700): Dynamic programming, XOR and bit manipulation. These are the standard competitive programming workhorses and appear in nearly every contest.
- Advanced structures (850–1000): Trees and graphs. Expect traversal, shortest paths, or tree DP.
If you're new to competitive programming, work through a structured problem set on a platform like Codeforces or LeetCode before the contest. If you're experienced, focus on speed and accuracy rather than new topics.
Round 1 — Part B (Quantitative)
The seven quant categories map almost exactly onto the material tested in quantitative finance interviews:
- Probability and conditional probability
- Combinatorics and counting
- Expected value and linearity of expectation
- Statistics and data interpretation
- Logic and game theory
- Mathematical optimization
- Integrated multi‑step problems
Standard resources apply: the "Green Book" (A Practical Guide to Quantitative Finance Interviews), Mosteller's Fifty Challenging Problems in Probability, and any solid undergraduate probability text. Our best books for quants guide covers these in more detail.
Because there's no partial scoring, accuracy beats speed on the harder problems. A wrong answer and a blank answer score the same: zero.
Round 2 — The Engineering Mindset
This is where most teams are unprepared. The Grand Finale isn't a harder version of Round 1 — it's a different competition entirely.
Practical preparation:
- Design for modularity. If your foundation modules don't share clean interfaces, integration will be painful.
- Prioritise ruthlessly. With no partial credit, a half‑finished integration module scores nothing. It may be better to bank all six foundation modules than to gamble on the final system.
- Plan for one laptop. Decide in advance who codes, who reviews, and who reasons. Practise this constraint with a mock session.
- Test against hidden cases. Write your own edge cases — empty inputs, maximum sizes, boundary conditions. Hidden test cases are unforgiving.
For broader context on how these skills map to real quant work, see our overview of Python for quants.
Why This Competition Matters Beyond the Prize
Most competitions test one thing. The QCC tests three: algorithmic problem‑solving, quantitative reasoning, and systems integration. That combination is unusually well‑calibrated to what quantitative trading firms actually do.
Round 1 mirrors the technical screen. Round 2 mirrors the job — taking independent research components and assembling them into a system that runs under real constraints, with a team, against a clock.
And because Jane Street is the sponsor, a strong showing is a meaningful signal rather than just a line on a CV. The firm's own interview process leans heavily on the same algorithmic and probabilistic reasoning the QCC tests. For another route into that world, our breakdown of the Jane Street Kaggle competition covers a very different kind of challenge from the same firm.
If you're mapping out your competition calendar, our overviews of the top algorithmic trading competitions and top quant hackathons and data science competitions will help you decide where this fits.
Key Takeaways
- The Quantitative Code Conflux is hosted by Techfest, IIT Bombay and sponsored by Jane Street.
- Round 1 is a 4‑hour online contest on HackerEarth, split evenly between algorithmic programming and quantitative reasoning — 7,300 points total.
- Ranking prioritises problems solved, then total points, then time penalty.
- No partial scoring in either round. All or nothing.
- Round 2 is a 5‑hour on‑site Modular Systems Challenge: 10 modules, 3 levels, 370 points, with a single‑laptop‑per‑team policy.
- Teams are 1–3 members, all from the same institution.
- Round 1 runs in two slots; each team competes once.
The QCC sharpens the engineer's edge. AlphaNova sharpens the modeller's.
Join the latest AlphaNova competition — a walk‑forward, cross‑sectional signal forecasting challenge with a $50,000 prize pool, pure Python, and no staking. Where the QCC tests how well you build systems under pressure, AlphaNova tests whether your signals survive out‑of‑sample reality.