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 22, 2025 06:43Rajarshi BasuRajarshi BasuScore: 31,997Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 06:4331,6731,075,485,7251,032,226,00012,990,0002,326,528
2Dec 22, 2025 06:4331,9971,085,009,3351,042,914,00012,998,0002,514,944
3Dec 22, 2025 06:4332,0231,083,219,0901,038,776,00017,996,0002,359,296