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, 2024 14:53E SequeiraE SequeiraScore: 338,241Success
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, 2024 14:53337,13511,163,956,43711,097,472,00027,983,0002,273,280
2Dec 14, 2024 14:53338,24111,194,749,25911,129,971,00031,982,0002,396,160
3Dec 14, 2024 14:53343,60111,372,594,77711,308,837,00029,981,0002,527,232