Skip to content
kliva

Urban Trail Aiaccina 2026

20.09.2026Ajaccio (France)
Build your race plan →

Pacing, fueling and crew sheet for the course you pick

4001’312 m D+ ft D+

12 km7.5 miUrban Traillongest of 2 courses

At a glance

Urban Trail Aiaccina 2026 took place on Sunday 20 September 2026 in Ajaccio (Corse-du-Sud, France). Two distances to choose from: 4.5 and 12 km.

Longest course: Urban Trail, 12 km with 400 m D+ (33 m per km: hilly terrain). Terrain: 55% trail, 6% forest track and 39% road. Terrain data: © OpenStreetMap contributors.

The 2027 edition is expected on Sunday 19 September 2027, date to be confirmed by the organiser. On Kliva, plan your pacing and nutrition for free, then send the plan to your watch.

The Urban Trail Aiaccina is a charity race organized by the Ligue contre le cancer in Ajaccio. The 11.8 km course (480 m D+) blends urban and natural environments, notably via the ridges offering…
From the organiser

2 courses

  1. 4.5km2.8mi

    100 m D+328 ft D+

    avg 2%

    Marche

    20.09.

    No index
  2. 12km7.5mi

    400 m D+1’312 ft D+

    496 m D-1’627 ft D-

    avg 3%

    Urban Trail

    20.09.

    No index
    GPX

Course analysis

The course

A 12 km course with 400 m of climbing, 61% off-road: 55% path, 6% forest track and 39% road.

The main climb comes early: from km 2.9 to km 6.4, +283 m up to 292 m, with the steepest pitch around 12%.

Urban Trail12 km7.5 mi400 m D+1’312 ft D+

16effort kmⓘ12 km on the map · feels like 16 km7.5 mi on the map · feels like 16 km
D+
400 m1’312 ft
D−
496 m1’627 ft
Max alt.
330 m1’083 ft
Steepest
12%

Segments

Skip the map

Elevation profile: Urban Trail

1 m – 330 m3 ft – 1’083 ft

Race plan

Plan your race from start to finish.

Pacing, aid stations and fueling timed to your effort on Urban Trail Aiaccina, in one roadbook.

Build a training route around this race →

Where to stay

Find a place to stay near Ajaccio for the race.

We may earn a commission if you book through this map, at no extra cost to you.

Spotted wrong info on this page? Tell us and we'll review it. Report it