benchmarks/hardest_coding_benchmarks.json

{
  "metadata": {
    "author": "Brad Wallace",
    "email": "coo@koba42.com",
    "github": "https://github.com/tensorrent/prime-fhe",
    "date": "2026-07-30T03:01:39Z",
    "license": "Apache-2.0",
    "suite": "Hardest Coding Benchmarks Sweep (LiveCodeBench-HARD + HumanEval+ + MBPP+)",
    "model": "Qwen/Qwen2.5-Coder-32B-Instruct"
  },
  "results": {
    "livecodebench_hard": {
      "dataset": "livecodebench/code_generation (HARD)",
      "total": 5,
      "valid_solutions": 5,
      "generation_rate_pct": 100.0,
      "evaluations": [
        {
          "task_id": "lcb_hard/atcoder/abc322_c",
          "platform": "atcoder",
          "difficulty": "medium",
          "title": "Festival",
          "generated": true,
          "code_length": 800,
          "latency_sec": 12.42,
          "code_sample": "def solve_fireworks_problem(N, M, A):\n    # Initialize the result array with the maximum possible days left\n    result = [N - i for i in range(N)]\n    \n    # Convert the list of firework days to a set for quick lookup\n    firework_days = set(A)\n    \n    # Initialize the next firework day to the last"
        },
        {
          "task_id": "lcb_hard/atcoder/abc322_a",
          "platform": "atcoder",
          "difficulty": "easy",
          "title": "First ABC 2",
          "generated": true,
          "code_length": 388,
          "latency_sec": 4.03,
          "code_sample": "def find_abc_position(N, S):\n    # Iterate through the string to find the first occurrence of \"ABC\"\n    for i in range(N - 2):\n        if S[i:i+3] == \"ABC\":\n            return i + 1  # Return the 1-based index\n    return -1  # Return -1 if \"ABC\" is not found\n\n# Read input\nN = int(input().strip())\nS "
        },
        {
          "task_id": "lcb_hard/atcoder/abc322_b",
          "platform": "atcoder",
          "difficulty": "easy",
          "title": "Prefix and Suffix",
          "generated": true,
          "code_length": 371,
          "latency_sec": 3.7,
          "code_sample": "def solve():\n    import sys\n    input = sys.stdin.read().split()\n    \n    N = int(input[0])\n    M = int(input[1])\n    S = input[2]\n    T = input[3]\n    \n    is_prefix = T[:N] == S\n    is_suffix = T[-N:] == S\n    \n    if is_prefix and is_suffix:\n        print(0)\n    elif is_prefix:\n        print(1)\n "
        },
        {
          "task_id": "lcb_hard/atcoder/abc322_e",
          "platform": "atcoder",
          "difficulty": "hard",
          "title": "Product Development",
          "generated": true,
          "code_length": 1477,
          "latency_sec": 17.19,
          "code_sample": "def main():\n    import sys\n    import itertools\n    \n    input = sys.stdin.read().split()\n    N = int(input[0])\n    K = int(input[1])\n    P = int(input[2])\n    \n    # Initialize the DP table with infinity\n    dp = [float('inf')] * (6 ** K)\n    dp[0] = 0  # Starting state with all parameters at 0\n   "
        },
        {
          "task_id": "lcb_hard/atcoder/abc323_e",
          "platform": "atcoder",
          "difficulty": "hard",
          "title": "Playlist",
          "generated": true,
          "code_length": 1748,
          "latency_sec": 18.86,
          "code_sample": "MOD = 998244353\n\ndef mod_inverse(a, m):\n    m0, x0, x1 = m, 0, 1\n    if m == 1:\n        return 0\n    while a > 1:\n        # q is quotient\n        q = a // m\n        m, a = a % m, m\n        x0, x1 = x1 - q * x0, x0\n    # Make x1 positive\n    if x1 < 0:\n        x1 += m0\n    return x1\n\ndef solve(N, X, "
        }
      ]
    },
    "humaneval_plus": {
      "dataset": "evalplus/humanevalplus",
      "total": 5,
      "valid_solutions": 5,
      "generation_rate_pct": 100.0,
      "evaluations": [
        {
          "task_id": "HumanEval/0",
          "entry_point": "has_close_elements",
          "generated": true,
          "code_length": 328,
          "latency_sec": 1.91,
          "code_sample": "def has_close_elements(numbers: List[float], threshold: float) -> bool:\n    if not numbers or threshold < 0:\n        return False\n    \n    sorted_numbers = sorted(numbers)\n    for i in range(len(sorted_numbers) - 1):\n        if abs(sorted_numbers[i] - sorted_numbers[i + 1]) < threshold:\n            "
        },
        {
          "task_id": "HumanEval/1",
          "entry_point": "separate_paren_groups",
          "generated": true,
          "code_length": 472,
          "latency_sec": 2.37,
          "code_sample": "def separate_paren_groups(paren_string: str) -> List[str]:\n    paren_string = paren_string.replace(\" \", \"\")\n    result = []\n    current_group = []\n    balance = 0\n\n    for char in paren_string:\n        if char == '(':\n            balance += 1\n        elif char == ')':\n            balance -= 1\n      "
        },
        {
          "task_id": "HumanEval/2",
          "entry_point": "truncate_number",
          "generated": true,
          "code_length": 499,
          "latency_sec": 2.67,
          "code_sample": "def truncate_number(number: float) -> float:\n    \"\"\" Given a positive floating point number, it can be decomposed into\n    an integer part (largest integer smaller than given number) and decimals\n    (leftover part always smaller than 1).\n\n    Return the decimal part of the number.\n    >>> truncate_"
        },
        {
          "task_id": "HumanEval/3",
          "entry_point": "below_zero",
          "generated": true,
          "code_length": 189,
          "latency_sec": 1.32,
          "code_sample": "def below_zero(operations: List[int]) -> bool:\n    balance = 0\n    for operation in operations:\n        balance += operation\n        if balance < 0:\n            return True\n    return False"
        },
        {
          "task_id": "HumanEval/4",
          "entry_point": "mean_absolute_deviation",
          "generated": true,
          "code_length": 213,
          "latency_sec": 1.61,
          "code_sample": "def mean_absolute_deviation(numbers: List[float]) -> float:\n    if not numbers:\n        return 0.0\n    mean = sum(numbers) / len(numbers)\n    mad = sum(abs(x - mean) for x in numbers) / len(numbers)\n    return mad"
        }
      ]
    },
    "mbpp_plus": {
      "dataset": "evalplus/mbppplus",
      "total": 5,
      "valid_solutions": 3,
      "generation_rate_pct": 60.0,
      "evaluations": [
        {
          "task_id": "Mbpp/2",
          "generated": true,
          "code_length": 471,
          "latency_sec": 3.88,
          "code_sample": "def find_shared_elements(list1, list2):\n    # Convert both lists to sets to find the intersection\n    set1 = set(list1)\n    set2 = set(list2)\n    \n    # Find the intersection of both sets\n    shared_elements = set1.intersection(set2)\n    \n    # Convert the set back to a sorted list for consistent ou"
        },
        {
          "task_id": "Mbpp/3",
          "generated": true,
          "code_length": 443,
          "latency_sec": 4.4,
          "code_sample": "def is_non_prime(n):\n    \"\"\"Return True if n is a non-prime number, otherwise False.\"\"\"\n    if n <= 1:\n        return True\n    if n <= 3:\n        return False\n    if n % 2 == 0 or n % 3 == 0:\n        return True\n    i = 5\n    while i * i <= n:\n        if n % i == 0 or n % (i + 2) == 0:\n            r"
        },
        {
          "task_id": "Mbpp/4",
          "generated": true,
          "code_length": 125,
          "latency_sec": 1.23,
          "code_sample": "def find_n_largest(numbers, n):\n    if n <= 0:\n        return []\n    import heapq\n    return heapq.nlargest(n, numbers)[::-1]"
        },
        {
          "task_id": "Mbpp/6",
          "generated": false,
          "error": "Client error '402 Payment Required' for url 'https://router.huggingface.co/v1/chat/completions' (Request ID: Root=1-6a6abe93-75618f736b8c34ee7e21b73b;4d12e40b-47e3-4eca-92ec-b240017fbacf)\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."
        },
        {
          "task_id": "Mbpp/7",
          "generated": false,
          "error": "Client error '402 Payment Required' for url 'https://router.huggingface.co/v1/chat/completions' (Request ID: Root=1-6a6abe93-20807606567deb6d511ee889;6b0b8d26-a647-4866-a0eb-db62b870a6dc)\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."
        }
      ]
    }
  }
}