Upload README.md with huggingface_hub

README.md

@@ -1,50 +1,17 @@
 ---
 license: apache-2.0
 task_categories:
-- text-generation
+  - text-generation
 language:
-- en
+  - en
 tags:
-- assembly
-- c
-- leetcode
-- compiler
-- code
+  - assembly
+  - c
+  - leetcode
+  - compiler
+  - code
 size_categories:
-- 1K<n<10K
-configs:
-- config_name: default
-  data_files:
-  - split: train
-    path: data/train-*
-dataset_info:
-  features:
-  - name: id
-    dtype: int64
-  - name: problem_id
-    dtype: int64
-  - name: problem_title
-    dtype: string
-  - name: difficulty
-    dtype: string
-  - name: c_source
-    dtype: string
-  - name: source_repo
-    dtype: string
-  - name: architecture
-    dtype: string
-  - name: optimization
-    dtype: string
-  - name: compiler
-    dtype: string
-  - name: assembly
-    dtype: string
-  splits:
-  - name: train
-    num_bytes: 49752046
-    num_examples: 7056
-  download_size: 8145862
-  dataset_size: 49752046
+  - 1K<n<10K
 ---
 
 # LeetCode Assembly Dataset
@@ -65,10 +32,23 @@ dataset_info:
 
 Each problem has **16 assembly variants** (4 architectures x 4 optimization levels), making this useful for studying how the same algorithm compiles differently across ISAs and optimization settings.
 
+## Key Insights
+
+- The dataset contains **1.48 million lines** of assembly (34.9M characters) across 7,056 rows.
+- **-O3 often produces more code than -O0**, not less. Across all architectures, -O3 output is 37-73% larger on average due to aggressive inlining and loop unrolling.
+- **-O1 consistently produces the most compact assembly** across all four architectures.
+- **Recursive tree problems see extreme -O3 blowup.** The top 10 largest O3-vs-O0 ratios are all binary tree problems. Worst case: Longest Univalue Path goes from 90 lines (O0) to 3,809 lines (O3) -- a 42x increase.
+- **Iterative and math problems shrink dramatically at -O3.** Flip String to Monotone Increasing drops from 89 to 8 lines (91% reduction). Nim Game compiles down to just 4 lines.
+- **AArch64 produces the most compact assembly at -O2** (avg 153 lines), followed by x86-64 (170), RISC-V (170), and MIPS64 (236). MIPS is 39% more verbose than AArch64.
+- **Hard problems produce 2x more assembly than Easy problems** at -O2 on x86-64 (247 vs 121 avg lines). Algorithmic complexity maps directly to code size.
+- **The largest output is LFU Cache** (1,121 lines at -O0 on x86-64), a complex doubly-linked list plus hash table implementation.
+- **The smallest output is Nim Game at -O3** (4 lines on x86-64) -- the entire solution optimizes to a single bitwise AND.
+
 ## Schema
 
 | Column | Type | Description |
 |--------|------|-------------|
+| `id` | int | Unique row identifier (0-7055) |
 | `problem_id` | int | LeetCode problem number |
 | `problem_title` | string | Problem name (e.g. "Two Sum") |
 | `difficulty` | string | Easy, Medium, or Hard |
@@ -78,7 +58,6 @@ Each problem has **16 assembly variants** (4 architectures x 4 optimization leve
 | `optimization` | string | GCC optimization flag: `-O0`, `-O1`, `-O2`, `-O3` |
 | `compiler` | string | Compiler version used |
 | `assembly` | string | Compiled assembly output |
-| `compilation_success` | bool | Whether compilation succeeded |
 
 ## Usage