Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listAug 18, 2026 15:33Victor MerckléVictor MerckléScore: 2,189Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 15:342,09962,993,958156,813,0002,037,0002,162,688stderr
2Aug 18, 2026 15:342,12863,852,893157,692,0002,007,0002,162,688stderr
3Aug 18, 2026 15:342,14964,496,608161,252,0001,028,0002,162,688stderr
4Aug 18, 2026 15:342,16965,082,045163,198,0002,026,0002,162,688stderr
5Aug 18, 2026 15:342,18965,678,714165,195,0002,018,0002,162,688stderr
6Aug 18, 2026 15:342,19365,817,253164,364,0001,023,0002,162,688stderr
7Aug 18, 2026 15:342,19965,980,846167,333,0003,040,0002,162,688stderr
8Aug 18, 2026 15:342,22266,684,211164,565,0001,035,0002,170,880stderr
9Aug 18, 2026 15:342,25667,705,693167,763,0001,042,0002,162,688stderr