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 listMar 22, 2026 18:41Dominique GarmierDominique GarmierScore: 348,078Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 18:41347,86215,282,303,88010,215,958,0001,263,489,0002,301,952
2Mar 22, 2026 18:41348,07813,157,304,77510,151,382,0001,335,208,0002,297,856
3Mar 22, 2026 18:41350,11216,367,410,98910,263,268,0001,290,422,0002,461,696