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 listAug 15, 2026 08:12Tomislav TunkovicTomislav TunkovicScore: 5,304Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 08:135,275183,326,450166,580,0007,517,0002,117,632
2Aug 15, 2026 08:135,281182,598,678166,774,0007,503,0002,117,632
3Aug 15, 2026 08:135,284182,659,561166,851,0007,549,0002,117,632
4Aug 15, 2026 08:135,286184,159,819166,965,0007,487,0002,117,632
5Aug 15, 2026 08:135,304183,404,998167,498,0007,549,0002,117,632
6Aug 15, 2026 08:135,332184,314,377168,372,0007,613,0002,117,632
7Aug 15, 2026 08:135,372185,538,403169,802,0007,491,0002,117,632
8Aug 15, 2026 08:135,377185,890,189169,924,0007,520,0002,117,632
9Aug 15, 2026 08:135,456188,550,930172,559,0007,490,0002,117,632