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 23, 2025 14:38Aniruddha DebAniruddha DebScore: 35,198Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2025 14:3834,7991,176,141,5731,107,376,00040,976,0002,424,832
2Mar 23, 2025 14:3835,1981,182,742,6711,124,535,00036,984,0002,269,184
3Mar 23, 2025 14:3835,4021,188,598,0371,120,289,00047,969,0002,351,104