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 listSep 22, 2024 17:23Павел РатмановПавел РатмановScore: 98,173Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 22, 2024 17:2397,7943,259,383,1743,043,353,000183,840,0002,482,176
2Sep 22, 2024 17:2398,1733,265,710,9483,047,916,000191,805,0002,281,472
3Sep 22, 2024 17:2398,9793,297,714,1573,091,458,000174,856,0002,449,408