|
--- |
|
library_name: mlx |
|
license: apache-2.0 |
|
license_link: https://huggingface.co/Qwen/Qwen3-4B-Instruct-2507/blob/main/LICENSE |
|
pipeline_tag: text-generation |
|
base_model: Qwen/Qwen3-4B-Instruct-2507 |
|
tags: |
|
- mlx |
|
- code |
|
datasets: |
|
- MCES10-Software/CPP-Code-Solutions |
|
language: |
|
- en |
|
--- |
|
<center> |
|
<img src="https://cdn-uploads.huggingface.co/production/uploads/65a17a03b172f47c9c31eab9/GY9R6DnA_TGzefzmq4HRi.png" width="200" height="200"> |
|
</center> |
|
|
|
# CPP-qwen3-4B-Instruct-2507 |
|
|
|
## Features |
|
|
|
- This model is based on qwen3-4B-Instruct-2507 |
|
- Fine Tuned on MCES10-Software/CPP-Code-Solutions Dataset |
|
- 4 Billion Parameters |
|
- Finetuned with MLX |
|
- model.safetensors |
|
|
|
## Benchmark |
|
MAX TOKENS = 500 |
|
Apple Silicon Macbook Pro 18,3 M1 PRO 16 GB RAM |
|
|
|
Write a function that checks if a number is prime. |
|
|
|
```cpp |
|
bool isPrime(int n) { |
|
if (n <= 1) return false; |
|
for (int i = 2; i * i <= n; ++i) { |
|
if (n % i == 0) return false; |
|
} |
|
return true; |
|
} |
|
``` |
|
49.27 tok/sec |
|
63 tokens |
|
0.24s to first token |
|
Credits |
|
|
|
MCES10 Software |
|
|
|
Thanks to: |
|
|
|
QWEN for the model |