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:12Павел РатмановПавел РатмановScore: 96,570Success
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:1295,9913,194,090,1822,985,891,000181,810,0002,387,968
2Sep 22, 2024 17:1296,5703,213,867,4172,997,013,000189,810,0002,297,856
3Sep 22, 2024 17:1296,8233,222,639,8773,015,316,000179,839,0002,387,968