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:25Павел РатмановПавел РатмановScore: 96,475Success
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:2596,4203,206,665,8493,014,023,000167,834,0002,289,664
2Sep 22, 2024 17:2596,4753,216,432,4192,997,866,000185,805,0002,527,232
3Sep 22, 2024 17:2597,2023,233,989,1723,030,837,000176,815,0002,281,472