Unique strings Sergey Svistunov

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 listJan 11, 2026 20:06Josu San MartinJosu San MartinScore: 5,415Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2026 16:185,409209,977,297177,489,000997,0002,392,064
2Jan 11, 2026 16:185,413203,017,490176,618,0001,995,0002,289,664
3Jan 11, 2026 20:065,413204,925,667176,634,0001,995,0002,289,664
4Jan 11, 2026 16:185,415203,590,319175,709,0002,995,0002,289,664
5Jan 11, 2026 20:065,416210,232,299176,730,0001,996,0002,392,064
6Jan 11, 2026 20:065,426202,851,354177,070,0002,000,0002,289,664