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 listDec 31, 2025 19:58Павел РатмановПавел РатмановScore: 92,570Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 31, 2025 19:5892,1313,201,833,8902,700,489,000339,823,0002,465,792
2Dec 31, 2025 19:5892,5703,242,469,4932,692,324,000362,485,0002,363,392
3Dec 31, 2025 19:5899,3965,704,674,3522,726,708,000553,346,0002,465,792