Benchmarking
If you like applying Benchmarking, every challenge here gives you a chance to practice it on a real industry brief.
- CodeIntermediateNew
Add Constant Folding and Dead Code Elimination to a Toy Compiler
Fork the repo, read the IR specification (3-address code, register-based, documented in /docs/ir.md). Implement constant folding as an IR-to-IR pass: any operation on literal op…
- Intermediate Representation
- Constant Folding
- Dead Code Elimination
Compiler Construction - AnalysisIntermediateNew
Pick a NoSQL Store for an Event-Stream Sidecar Cache
Set up identical 3-node clusters of Redis 7, KeyDB, and DragonflyDB on equivalent hardware. Run the team's captured 24-hour workload trace (around 180k ops/second, 80/20 read/wr…
- Nosql
- Redis
- Benchmarking
Introduction to Database Systems - ResearchIntermediateNew
Hyperparameter Search via CMA-ES for a Pharma QSAR Model
You receive a labeled QSAR dataset (around 25,000 compounds, regression on a binding-affinity target), a fixed feature pipeline (Morgan fingerprints + descriptors), and the team…
- Cma Es
- Metaheuristics
- Hyperparameter Optimization
Evolutionary Computation and Metaheuristic Search - CodeIntermediateNew
Shortest-Path Routing for a Bike-Share Operator
Receive the graph (nodes with lat/lon/elevation, edges with length and slope) and 50 origin-destination test pairs. Implement Dijkstra's algorithm with a custom edge-weight func…
- Graph Algorithms
- Dijkstra
- Algorithm Analysis
Algorithm Design and Analysis Practice your coursework on real scenarios.
Every challenge is shaped from real industry context — not generic exercises. The work mirrors what your degree prepares you for.
Why Ewance
- AnalysisIntermediateNew
Evaluate Speech-to-Text Quality for a Contact-Center Analytics Vendor
You receive 200 anonymized call-recording snippets (2-4 minutes each, ~67 per language) with reference transcripts plus a domain glossary of about 600 product terms. Run all thr…
- Speech Recognition
- Sequence Models
- Model Evaluation
Machine Perception - CodeIntermediateNew
Build a Bounded Concurrent Queue for a Microservice Worker Pool
Implement a bounded concurrent queue in Go (no third-party queue libraries; standard library + sync primitives only) that supports: Put(item) blocks when full, TryPut(item, time…
- Concurrent Data Structures
- Mutex And Condvar
- Go
Concurrent and Parallel Programming - CodeIntermediateNew
Design a Race-Free Cache for a Read-Heavy Service
Implement a thread-safe LRU-bounded cache in Java (or Go — your choice, defend it) with: read-write lock or copy-on-write semantics, get-or-load pattern with single-flight to de…
- Concurrent Data Structures
- Race Conditions
- Single Flight
Concurrent and Parallel Programming - CodeIntermediateNew
Quantize a Vision Model for a Smart-Doorbell SoC
You receive a trained FP32 PyTorch person-detector (mAP 0.74 on a 5k validation set) plus a calibration dataset of 500 unlabeled doorbell frames. Convert to ONNX, then apply pos…
- Quantization
- Model Optimization
- Onnx
Edge ML and On-Device Machine Learning - Browse challenges
Explore role
Product Manager
Ship product that solves real user problems. Combine user research, prototyping, and stakeholder alignment to turn ambiguous briefs into measurable wins — the role at the centre of modern software teams.
- AnalysisIntermediateNew
Instruction Set Analysis for an Embedded Workload
Compile all 12 workload programs to both ISAs using the appropriate cross-compiler (GCC with -march=rv32e for RISC-V; provided proprietary toolchain for the in-house ISA). Repor…
- Instruction Sets
- Code Density
- Embedded Systems
Computer Architecture - AnalysisIntermediateNew
Cache Configuration Study for a Memory-Bound Workload
Profile the existing inner loop on a workstation with perf to baseline L1/L2/L3 miss rates and miss latencies. Run the same loop through gem5's classic cache model under 6 confi…
- Caches
- Memory Subsystems
- Performance Modeling
Computer Architecture - AnalysisIntermediateNew
Choose a Hash Table vs Trie for a URL-Shortener Cache
Implement (1) a hash-table cache with linear probing and (2) a compressed trie cache, both with the same eviction policy (LRU). Measure (a) p50/p99 lookup latency, (b) memory fo…
- Hash Tables
- Trie Data Structure
- Benchmarking
Data Structures - AnalysisIntermediateNew
Transfer Pricing for a Lagos D2C Cosmetics Startup
You are a junior tax consultant hired by GlowLagos. Your task is to analyze the current intercompany transactions (raw material purchases, manufacturing fees, and royalty paymen…
- Transfer Pricing
- Benchmarking
- Functional Analysis
International Taxation of Multinationals Build a verifiable portfolio.
Submissions become evidence. Reviewers with shipping experience score against a rubric; the result becomes a credential anyone can verify.
Why Ewance
- CodeIntermediateNew
Build a Multi-Level Feedback Queue Scheduler in xv6
Fork the xv6-riscv repository and implement MLFQ in proc.c with 3 priority queues, per-queue time slices (10ms / 20ms / 40ms), priority demotion on slice exhaustion, and a 100ms…
- Operating Systems
- Scheduling
- C Programming
Operating Systems - CodeIntermediateNew
Build a Reliable Transport Layer Over UDP
Implement in Go: connection establishment (3-way handshake), sequenced and acknowledged data segments, retransmission timer with exponential backoff, fast retransmit on triple d…
- Tcp Ip
- Reliable Transport
- Udp
Computer Networks - CodeIntermediateNew
Greedy Algorithm for Delivery-Slot Assignment
Receive 14 days of order data (around 4,800 orders) with timestamps, addresses (already geocoded), and slot preferences, plus rider rosters with shift starts, ends, and max work…
- Greedy Algorithms
- Algorithm Analysis
- Python
Algorithm Design and Analysis - ResearchIntermediateNew
Evaluate Open-Source Embedding Models for a Multilingual Help Center
You receive 1,200 labeled (query, relevant-help-article) pairs across 6 languages plus the help-center corpus (~25,000 articles). Index the corpus with each of 4 open-source mul…
- Multilingual Embeddings
- Dense Retrieval
- Ir Evaluation
Information Retrieval and Search
How it works
From brief to credential, in six steps.
Step 01
Browse challenges aligned to your studies.
Step 02
Accept the one that fits your goals.
Step 03
Work through it with AI Copilot guidance.
Step 04
Submit for structured evaluation.
Step 05
Earn a verified credential.
Step 06
Add it to LinkedIn with one click.
Industry teams behind a decade of practitioner briefs
Hiring from this pool?
Sponsor a challenge and meet candidates through actual work.
Industry teams can shape briefs around the skills they hire for, then evaluate students on rubric-scored deliverables — not resumes.