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 14, 2025 14:03Rajarshi BasuRajarshi BasuScore: 8,207Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 14, 2025 14:038,206295,405,413261,799,0008,993,0002,297,856
2Dec 14, 2025 14:038,207302,662,108261,822,0008,993,0002,506,752
3Dec 14, 2025 14:038,210300,640,559259,947,00010,997,0002,473,984