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 listOct 30, 2021 14:41Mikhail ShirokovMikhail ShirokovScore: 150,537Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 30, 2021 14:41149,5415,005,979,9024,934,842,62802,215,936
2Oct 30, 2021 14:41150,5375,037,500,1934,967,722,46702,256,896
3Oct 30, 2021 14:41152,3655,089,415,5175,028,047,30802,236,416