benchmarks/tough_coding_benchmarks.json

{
  "metadata": {
    "author": "Brad Wallace",
    "email": "coo@koba42.com",
    "github": "https://github.com/tensorrent/prime-fhe",
    "date": "2026-07-30T02:58:47Z",
    "license": "Apache-2.0",
    "suite": "Tough Coding Benchmarks (LiveCodeBench + HumanEvalPack)",
    "model": "Qwen/Qwen2.5-Coder-32B-Instruct"
  },
  "results": {
    "livecodebench": {
      "dataset": "livecodebench/code_generation",
      "total": 5,
      "valid_solutions": 5,
      "generation_rate_pct": 100.0,
      "evaluations": [
        {
          "task_id": "lcb/atcoder/abc301_f",
          "platform": "atcoder",
          "title": "Anti",
          "generated": true,
          "code_length": 3998,
          "latency_sec": 19.11,
          "code_sample": "To solve this problem, we need to count the number of ways to replace the question marks (`?`) in the given string `S` such that no DDoS-type subsequence is formed. A DDoS-type subsequence is defined as a sequence of four characters where the first two and the last characters are uppercase and ident"
        },
        {
          "task_id": "lcb/atcoder/abc301_a",
          "platform": "atcoder",
          "title": "Overall Winner",
          "generated": true,
          "code_length": 675,
          "latency_sec": 3.98,
          "code_sample": "def find_overall_winner(N, S):\n    takahashi_wins = 0\n    aoki_wins = 0\n    \n    for i in range(N):\n        if S[i] == 'T':\n            takahashi_wins += 1\n        else:\n            aoki_wins += 1\n        \n        # Check if either has reached the majority of wins\n        if takahashi_wins > N // 2:"
        },
        {
          "task_id": "lcb/atcoder/abc301_c",
          "platform": "atcoder",
          "title": "AtCoder Cards",
          "generated": true,
          "code_length": 1149,
          "latency_sec": 6.22,
          "code_sample": "def can_win_with_cheating(S, T):\n    # Count the occurrences of each character in S and T\n    from collections import Counter\n    \n    # Create counters for S and T\n    count_S = Counter(S)\n    count_T = Counter(T)\n    \n    # Characters that can replace '@'\n    replaceable_chars = {'a', 't', 'c', 'o"
        },
        {
          "task_id": "lcb/atcoder/abc301_d",
          "platform": "atcoder",
          "title": "Bitmask",
          "generated": true,
          "code_length": 1349,
          "latency_sec": 8.72,
          "code_sample": "def max_binary_value(S, N):\n    # Replace all '?' with '1' to get the maximum possible binary number\n    max_possible = int(S.replace('?', '1'), 2)\n    \n    # If the maximum possible value is less than or equal to N, return it\n    if max_possible <= N:\n        return max_possible\n    \n    # Convert "
        },
        {
          "task_id": "lcb/atcoder/abc301_b",
          "platform": "atcoder",
          "title": "Fill the Gaps",
          "generated": true,
          "code_length": 837,
          "latency_sec": 4.39,
          "code_sample": "def solve_sequence(N, A):\n    while True:\n        modified = False\n        new_sequence = []\n        i = 0\n        while i < N - 1:\n            new_sequence.append(A[i])\n            if abs(A[i] - A[i + 1]) != 1:\n                modified = True\n                if A[i] < A[i + 1]:\n                    "
        }
      ]
    },
    "humanevalpack": {
      "dataset": "bigcode/humanevalpack",
      "total": 5,
      "valid_solutions": 4,
      "generation_rate_pct": 80.0,
      "evaluations": [
        {
          "task_id": "Python/0",
          "bug_type": "missing logic",
          "generated": true,
          "code_length": 348,
          "latency_sec": 3.66,
          "code_sample": "from typing import List\n\ndef has_close_elements(numbers: List[float], threshold: float) -> bool:\n    for idx, elem in enumerate(numbers):\n        for idx2, elem2 in enumerate(numbers):\n            if idx != idx2:\n                distance = elem - elem2\n                if abs(distance) < threshold:\n "
        },
        {
          "task_id": "Python/1",
          "bug_type": "operator misuse",
          "generated": true,
          "code_length": 669,
          "latency_sec": 7.38,
          "code_sample": "from typing import List\n\ndef separate_paren_groups(paren_string: str) -> List[str]:\n    result = []\n    current_string = []\n    current_depth = 0\n\n    for c in paren_string:\n        if c == ' ':\n            continue  # Ignore spaces\n        if c == '(':\n            current_depth += 1\n            cur"
        },
        {
          "task_id": "Python/2",
          "bug_type": "excess logic",
          "generated": true,
          "code_length": 68,
          "latency_sec": 3.69,
          "code_sample": "def truncate_number(number: float) -> float:\n    return number % 1.0"
        },
        {
          "task_id": "Python/3",
          "bug_type": "operator misuse",
          "generated": true,
          "code_length": 202,
          "latency_sec": 3.07,
          "code_sample": "from typing import List\n\ndef below_zero(operations: List[int]) -> bool:\n    balance = 0\n\n    for op in operations:\n        balance += op\n        if balance < 0:\n            return True\n\n    return False"
        },
        {
          "task_id": "Python/4",
          "generated": false,
          "error": "Client error '402 Payment Required' for url 'https://router.huggingface.co/v1/chat/completions' (Request ID: Root=1-6a6abde7-5cdb993d70fb40967db26b6f;a645b40a-b5e6-4392-b4b5-7dc614479303)\nFor more information check: https://developer.mozilla.org/en-US/docs/Web/HTTP/Status/402\n\nYou have depleted your monthly included credits. Purchase pre-paid credits to continue using Inference Providers. Alternatively, subscribe to PRO to get 20x more included usage."
        }
      ]
    }
  }
}