{
  "checked_at": "2026-09-22T08:49:32.414289+00:00",
  "hardware": "Apple M3 Pro, 18 GiB unified memory",
  "runtime": "llama.cpp b10470 commit 34af94cd9",
  "model": "bartowski/MiMo-V2.6-Distill-Qwen-9B-GGUF Q3_K_M",
  "revision": "4371da10c84fb26da3592d4cf312d24aa82b7b65",
  "context": 2048,
  "max_generated_tokens": 256,
  "temperature": 0,
  "seed": 42,
  "warmup": false,
  "scope": "local text smoke tests, not a model leaderboard; first two runs overlapped blog build; no dedicated GPU-memory measurement",
  "runs": [
    {
      "run": 1,
      "code": "def unique_in_order(values):\n    if not values:\n        return []\n    result = [values[0]]\n    for value in values[1:]:\n        if value != result[-1]:\n            result.append(value)\n    return result",
      "tests": [
        {
          "input": [],
          "expected": [],
          "actual": [],
          "passed": true
        },
        {
          "input": [
            1,
            1,
            2
          ],
          "expected": [
            1,
            2
          ],
          "actual": [
            1,
            2
          ],
          "passed": true
        },
        {
          "input": [
            1,
            2,
            1,
            3,
            2
          ],
          "expected": [
            1,
            2,
            3
          ],
          "actual": [
            1,
            2,
            1,
            3,
            2
          ],
          "passed": false
        },
        {
          "input": [
            "a",
            "b",
            "a"
          ],
          "expected": [
            "a",
            "b"
          ],
          "actual": [
            "a",
            "b",
            "a"
          ],
          "passed": false
        }
      ],
      "timing": "[ Prompt: 8.1 t/s | Generation: 14.4 t/s ]",
      "wall_seconds": 27.74,
      "max_rss_bytes": 2047098880,
      "prompt": "Write a Python function unique_in_order(values) that removes duplicates while preserving first occurrence order. Inputs are hashable. Return only the function, with no explanation."
    },
    {
      "run": 2,
      "code": "def unique_in_order(values):\n    result = []\n    for value in values:\n        if not result or value != result[-1]:\n            result.append(value)\n    return result",
      "tests": [
        {
          "input": [],
          "expected": [],
          "actual": [],
          "passed": true
        },
        {
          "input": [
            1,
            1,
            2
          ],
          "expected": [
            1,
            2
          ],
          "actual": [
            1,
            2
          ],
          "passed": true
        },
        {
          "input": [
            1,
            2,
            1,
            3,
            2
          ],
          "expected": [
            1,
            2,
            3
          ],
          "actual": [
            1,
            2,
            1,
            3,
            2
          ],
          "passed": false
        },
        {
          "input": [
            "a",
            "b",
            "a"
          ],
          "expected": [
            "a",
            "b"
          ],
          "actual": [
            "a",
            "b",
            "a"
          ],
          "passed": false
        }
      ],
      "timing": "[ Prompt: 129.6 t/s | Generation: 13.7 t/s ]",
      "wall_seconds": 15.62,
      "max_rss_bytes": 4149346304,
      "prompt": "Write a Python function unique_in_order(values) that removes duplicates while preserving first occurrence order. Inputs are hashable. Return only the function, with no explanation. Example: [1, 2, 1, 3, 2] must return [1, 2, 3]."
    },
    {
      "run": 3,
      "code": "def unique_in_order(values):\n    if not values:\n        return []\n    result = [values[0]]\n    for value in values[1:]:\n        if value != result[-1]:\n            result.append(value)\n    return result",
      "tests": [
        {
          "input": [],
          "expected": [],
          "actual": [],
          "passed": true
        },
        {
          "input": [
            1,
            1,
            2
          ],
          "expected": [
            1,
            2
          ],
          "actual": [
            1,
            2
          ],
          "passed": true
        },
        {
          "input": [
            1,
            2,
            1,
            3,
            2
          ],
          "expected": [
            1,
            2,
            3
          ],
          "actual": [
            1,
            2,
            1,
            3,
            2
          ],
          "passed": false
        },
        {
          "input": [
            "a",
            "b",
            "a"
          ],
          "expected": [
            "a",
            "b"
          ],
          "actual": [
            "a",
            "b",
            "a"
          ],
          "passed": false
        }
      ],
      "timing": "[ Prompt: 85.2 t/s | Generation: 15.3 t/s ]",
      "wall_seconds": 14.49,
      "max_rss_bytes": 4126556160,
      "prompt": "Write a Python function unique_in_order(values) that removes duplicates while preserving first occurrence order. Inputs are hashable. Return only the function, with no explanation."
    }
  ],
  "sha256": "d98e54ec9650b6554cfdeea531e2420009207d50471170d0c3640483df8e87eb",
  "hash_verified": true
}