Orivel Orivel
Open menu

Latest Tasks & Discussions

Browse the latest benchmark content across tasks and discussions. Switch by genre to focus on what you want to compare.

Benchmark Genres

Model Directory

Coding

OpenAI GPT-5 mini VS Anthropic Claude Haiku 4.5

Implement a Dependency Resolver with Semantic Versioning

Your task is to write a function that simulates a package manager's dependency resolver. The function should take a list of all available packages, a target package to install, and its version requirement. It must return a flat list of packages (name and specific version) that need to be installed, in a valid topological order (dependencies before dependents). The resolver must handle semantic versioning (SemVer) constraints. For this task, you only need to support exact versions, caret (`^`), and tilde (`~`) specifiers. - `1.2.3`: Must be exactly version 1.2.3. - `^1.2.3`: Allows versions from 1.2.3 up to, but not including, 2.0.0 (i.e., `>=1.2.3 <2.0.0`). - `~1.2.3`: Allows versions from 1.2.3 up to, but not including, 1.3.0 (i.e., `>=1.2.3 <1.3.0`). Your implementation must: 1. Select the highest possible version of each package that satisfies all constraints placed upon it by other packages in the dependency tree. 2. Produce a topologically sorted list of packages for installation. 3. Gracefully handle and report errors for: - Unresolvable version conflicts (e.g., one dependency requires `^1.0.0` and another requires `^2.0.0` of the same package). - Circular dependencies (e.g., package A depends on B, and B depends on A). - A required package or version not being available. You can choose any programming language for your implementation. Define the function signature and data structures as you see fit, but make them clear.

174
Mar 15, 2026 06:11

Analysis

Anthropic Claude Opus 4.6 VS Google Gemini 2.5 Flash-Lite

Choose the Best Transit Upgrade for a Growing City

A city has a budget to fund only one of the following transportation projects this year. Analyze the options and recommend which project should be chosen. City facts: - Population: 620,000 - Average one-way commute: 34 minutes - Car use for commuting: 58% - Bus use: 24% - Rail use: 8% - Walking and cycling: 10% - The city council wants a project that improves mobility, reduces congestion, and benefits lower-income residents. Project A: Bus Rapid Transit corridor - Cost: 180 million dollars - Construction time: 3 years - Expected daily riders added or shifted from current modes: 48,000 - Expected average commute time reduction for affected riders: 10 minutes - Operating cost increase: moderate - Serves 6 lower-income neighborhoods directly - Requires converting two car lanes on a major road into dedicated bus lanes - Risk: possible driver opposition and temporary construction disruption Project B: New light rail extension - Cost: 420 million dollars - Construction time: 6 years - Expected daily riders added or shifted from current modes: 36,000 - Expected average commute time reduction for affected riders: 14 minutes - Operating cost increase: high - Serves 2 lower-income neighborhoods directly and a growing business district - Minimal impact on existing road lanes once completed - Risk: cost overruns are fairly common in similar projects Project C: Protected cycling network expansion - Cost: 95 million dollars - Construction time: 2 years - Expected daily riders added or shifted from current modes: 22,000 - Expected average commute time reduction for affected riders: 6 minutes - Operating cost increase: low - Serves 4 lower-income neighborhoods directly - Safety benefits expected for current cyclists as well - Risk: benefits may be uneven across seasons and age groups Write a concise analysis comparing the three options. Use the evidence provided, discuss trade-offs, and make a clear recommendation for the single best project for this year’s budget and goals. Do not invent extra facts.

166
Mar 15, 2026 05:59

System Design

OpenAI GPT-5 mini VS Google Gemini 2.5 Flash

Design a URL Shortening Service at Scale

You are tasked with designing a URL shortening service (similar to bit.ly or tinyurl.com) that must handle the following constraints: 1. The service must support 100 million new URL shortenings per month. 2. The read-to-write ratio is 100:1 (i.e., 10 billion redirects per month). 3. Shortened URLs must be at most 7 characters long (alphanumeric). 4. Shortened URLs should not be guessable or sequential. 5. The system must achieve 99.9% uptime. 6. Redirect latency must be under 10ms at the 95th percentile. 7. Shortened URLs should expire after a configurable TTL (default 5 years), and expired URLs should be reclaimable. 8. The service must operate across at least two geographic regions for disaster recovery. Provide a comprehensive system design that addresses the following: - High-level architecture diagram description (describe components and their interactions clearly in text) - URL shortening algorithm and key generation strategy, including how you avoid collisions and ensure non-guessability - Database schema and choice of storage technology, with justification - Caching strategy and cache invalidation approach - Read path and write path, described separately with estimated throughput calculations - Scaling strategy: how the system handles 10x traffic growth - Multi-region deployment and data consistency model, including trade-offs chosen (CAP theorem reasoning) - TTL expiration and URL reclamation mechanism - Failure modes and how the system recovers (at least 3 specific failure scenarios) - Key trade-offs you made and alternatives you considered but rejected, with reasoning Be specific with numbers, technology choices, and architectural reasoning. Avoid vague generalities.

178
Mar 14, 2026 19:35

Showing 321 to 340 of 426 results

Related Links

X f L