Problems
{% for folder, description, test_code, difficulty in problems %}
{{ folder.replace('_',' ').title() }}
{{ difficulty }}
{% else %}
No problems yet.
{% endfor %}
Page 1 of 1
Leaderboard ℹ️
| Rank | User | Problem | Runtime (s) | Memory (KB) | Line | Timestamp |
|---|---|---|---|---|---|---|
| {{ loop.index }} | {{ entry[0] }} | {{ problem_titles.get(entry[1], 'Unknown') }} | {{ '%.4f'|format(entry[2]) }} | {{ entry[3] }} | {{ entry[4] if entry[4] else '-' }} | {{ entry[5] }} |
| No leaderboard entries yet. | ||||||
How Ranking Works
The leaderboard uses a weighted scoring system to determine overall rank:
- Runtime: How fast the solution runs (lower is better).
- Memory Usage: How much memory the solution uses (lower is better).
Overall score is calculated as:
runtimeScore = yourRuntime / bestRuntime
memoryScore = yourMemory / bestMemory
overallScore = runtimeScore × 0.7 + memoryScore × 0.3
Lower overall scores are better. If scores are equal, earlier submission ranks higher.