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 31, 2026 12:25Victor MerckléVictor MerckléScore: 1,850Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 12:271,83054,914,506133,629,0001,017,0002,170,880stderr
2Aug 31, 2026 12:271,83254,961,625134,686,0001,070,0002,170,880stderr
3Aug 31, 2026 12:271,83455,031,275133,734,0001,039,0002,170,880stderr
4Aug 31, 2026 12:271,84655,407,647133,827,0001,071,0002,170,880stderr
5Aug 31, 2026 12:271,85055,516,746132,978,0001,058,0002,170,880stderr
6Aug 31, 2026 12:271,86555,962,918134,644,0001,065,0002,170,880stderr
7Aug 31, 2026 12:271,86656,001,747134,742,0001,063,0002,170,880stderr
8Aug 31, 2026 12:271,86655,992,167134,524,0001,055,0002,170,880stderr
9Aug 31, 2026 12:271,88956,691,535133,407,0001,065,0002,170,880stderr