Benchmarking
If you like applying Benchmarking, every challenge here gives you a chance to practice it on a real industry brief.
- AnalysisAdvancedNew
Design a Custom Page-Replacement Policy for a Tier-1 Cloud Provider Simulator
Use the provided simulator (Python harness wrapping a C++ page-cache model) and the team's 3 anonymized workload traces (web-cache, key-value store, batch analytics). Implement …
- Memory Management
- Page Replacement
- Benchmarking
Operating Systems - CodeAdvancedNew
Build a Streaming Pipeline for Real-Time Fraud Detection
Receive 30 days of anonymized card-transaction events (around 240M events total), the team's existing batch features (cardholder behavior summaries), and a pre-trained fraud-sco…
- Stream Processing
- Kafka
- Flink
Big Data and Data-Intensive Systems - AnalysisAdvancedNew
Amortized-Analysis Investigation of a Production Cache
Read the C++ cache source (around 1,800 lines, custom open-addressing with periodic resize-and-rehash). Perform amortized analysis using all three methods (aggregate, accounting…
- Amortized Analysis
- Data Structures
- Algorithm Analysis
Advanced Algorithms - CodeAdvancedNew
Build a User-Space File System with FUSE for a Storage Startup
Build a FUSE driver (your choice of Rust + fuser crate or Go + bazil/fuse) that proxies POSIX operations to the startup's existing S3-compatible REST API (mock provided). Suppor…
- File Systems
- Fuse
- Rust Programming
Operating Systems 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
- CodeAdvancedNew
Train a Deep Q-Network for Warehouse Robot Routing
You receive a Gymnasium-compatible warehouse simulator (50x50 grid, 8 dynamic obstacle pedestrians, 20 randomized pick locations) and a baseline A* planner script. Train a DQN a…
- Deep Q Learning
- Reinforcement Learning
- Pytorch
Deep Reinforcement Learning - CodeAdvancedNew
Index a Genomics Dataset with a Suffix Array for Read Matching
Implement a suffix array over a 720 MB DNA sequence (4-character alphabet) using DC3 (Difference Cover modulo 3) or SA-IS construction in Rust. Build pattern-matching utilities …
- Suffix Arrays
- String Algorithms
- Rust
Data Structures - ResearchAdvancedNew
Compiler Fuzzing Campaign on a Production C Backend
Stand up a Csmith-based generator producing 200,000+ random valid C programs over the campaign. Differential-test the target backend against a baseline C compiler (matching opti…
- Fuzzing
- Differential Testing
- Test Case Minimization
Advanced Compilers and Program Optimization - CodeAdvancedNew
Build a 5-Stage Pipelined RISC-V Core in Verilog
Implement the 5-stage pipeline with: hazard detection unit, forwarding paths (EX/MEM to EX, MEM/WB to EX), pipeline stalls for load-use hazards, and a simple static branch-not-t…
- Pipelining
- Hazard Detection
- Verilog
Computer Architecture - 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.
- AnalysisAdvancedNew
Cost-Profile a Spark Job at Scale and Cut the Bill in Half
Receive the PySpark job (around 1,800 lines), 5 nights of Spark UI + EMR metrics, and the EMR cluster config. Profile to find the top 3 cost drivers (likely candidates: skewed j…
- Spark
- Cost Optimization
- Etl Pipelines
Big Data and Data-Intensive Systems - ResearchAdvancedNew
Compare Kernel Methods to Trees on a Genomics Classification Task
You receive a curated benchmark of about 12,000 labeled variants with ~120 numerical + ~40 string features. Fit kernel SVMs (RBF, polynomial, string), random forest, and XGBoost…
- Kernel Methods
- Svm
- Tree Ensembles
Statistical Machine Learning - CodeAdvancedNew
Migrate an Internal Service from REST to gRPC
Receive the existing OpenAPI spec, the Go service code, and 7 days of traffic data. Pick the top 2 RPS-by-method endpoints and design Protocol Buffers (protobuf) message + servi…
- Grpc
- Protobuf
- Api Design
API Design and GraphQL - CodeAdvancedNew
Multi-Sensor Late-Fusion Prototype for an Indoor AGV
Use the public KITTI dataset (or a similar paired LiDAR+RGB dataset) restricted to static-obstacle classes. Implement a late-fusion baseline: a LiDAR-only detector (PointPillars…
- Sensor Fusion
- 3d Object Detection
- Perception
AI for Autonomous Vehicles 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
- AnalysisAdvancedNew
ODE Integrator Benchmark for a Pharma PK/PD Pipeline
Use SciPy's solve_ivp + SUNDIALS (via scikit-sundae or diffeqpy) to benchmark: RK45 (baseline), LSODA, BDF (CVODE), Radau, and Rosenbrock. Run on three model classes (insulin-gl…
- Numerical Odes
- Stiff Integrators
- Scientific Python
Scientific Computing and Numerical Methods - ResearchAdvancedNew
Lab Project: Compare Three Architectures on Your Own Mini-Benchmark
Scope the problem yourself (suggested examples: sentiment classification on a niche domain, tabular anomaly detection, time-series forecasting on a public dataset). Define the t…
- Experiment Design
- Statistical Testing
- Pytorch
AI/ML Practicum and Hands-on Lab - CodeAdvancedNew
Out-of-Order Execution Microbenchmark Suite
Design and implement 6 microbenchmarks: ROB capacity probe (varying chain length), load-store queue probe, branch mispredict cost probe, ILP saturation probe, store-to-load forw…
- Out Of Order Execution
- Performance Counters
- Benchmarking
Advanced Computer Architecture - CodeAdvancedNew
Apply Software Transactional Memory to a Real-Time Auction Book
Implement two variants of the same auction-book API (best-bid/best-ask lookup, place-order, cancel-order, match-orders): (1) baseline with java.util.concurrent locks + a SkipLis…
- Transactional Memory
- Concurrent Data Structures
- Haskell
Advanced Concurrency and Parallel Computing - AnalysisAdvancedNew
Branch Predictor Study for a Cryptocurrency Hashing Library
Profile the hot inner loop with perf record + perf annotate to identify the 5 highest-frequency branches. Measure per-branch mispredict counts using perf counters (BR_MISP_RETIR…
- Branch Prediction
- Performance Counters
- Benchmarking
Computer Architecture - ResearchAdvancedNew
Evaluate a Knowledge-Graph-Augmented Recommender
You receive permission to use the public MovieLens 1M dataset plus a derived item-KG (movie -> genre, director, decade) built from Wikidata. Train two recommenders: a matrix-fac…
- Knowledge Graph Embeddings
- Recommender Systems
- Benchmarking
Knowledge Graphs and Semantic Web - CodeAdvancedNew
Profile-Guided Optimization for a Production JavaScript Bundler
Read the bundler's existing release-build pipeline (Rust + Cargo). Design and implement a PGO workflow using Rust's profile-guided LLVM PGO: instrument build, training run on th…
- Profile Guided Optimization
- Llvm
- Benchmarking
Advanced Compilers and Program Optimization - AnalysisAdvancedNew
Evaluate an Agent Suite on the SWE-Bench-Style Coding Benchmark
You receive a sandboxed set of 50 small repo-modification tasks (test-passing as the success signal). Run 3 open-source agent frameworks (e.g., OpenHands, SWE-agent, and Aider) …
- Llm Agents
- Agent Evaluation
- Benchmarking
AI Agents and LLM-Based Agents - CodeAdvancedNew
GPU-Parallel Graph Coloring for an EDA Tools Vendor
Implement Jones-Plassmann graph coloring in CUDA (or HIP if AMD hardware available). Input: a 12-million-node graph in CSR format (compressed sparse row). Output: a valid colori…
- Parallel Algorithms
- Gpu Programming
- Cuda
Parallel and Distributed Algorithms - CodeAdvancedNew
Parallelize a Monte Carlo Risk Engine for a Quant Hedge Fund
Profile the existing engine (C++17, single-threaded). Identify the parallelism axis (per-path independence is the obvious one — but watch for the global RNG bottleneck). Impleme…
- Parallel Algorithms
- Shared Memory
- Work Stealing
Parallel and Distributed Algorithms - AnalysisAdvancedNew
Cache Coherence Protocol Comparison on a Multicore Simulator
Stand up gem5's Ruby coherence framework with both MESI and MOESI protocols on a 16-core configuration. Run the 6-benchmark suite (provided): producer-consumer queue, false-shar…
- Cache Coherence
- Multicore Architecture
- Simulation
Advanced Computer Architecture - CodeAdvancedNew
Implement Federated Learning for a Government Statistics Office
Use Flower as the FL framework. Simulate 8 municipalities each with a partition of a synthetic wage dataset (provided, 1M rows, EU-Labour-Force-Survey schema). Train a gradient-…
- Federated Learning
- Differential Privacy
- Python Programming
Privacy-Enhancing Technologies
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.