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 listNov 20, 2025 20:53izotoffizotoffScore: 91,105Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 20, 2025 20:5390,7773,021,581,5672,976,649,00018,991,0002,506,752
2Nov 20, 2025 20:5391,1053,035,756,1182,993,461,00012,993,0002,285,568
3Nov 20, 2025 20:5391,8893,064,675,2083,018,351,00013,992,0002,310,144