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 9, 2024 16:35Jatin YadavJatin YadavScore: 41,188Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2024 16:3541,0611,386,476,1491,323,036,00031,976,0002,404,352
2Sep 9, 2024 16:3541,1881,386,710,7221,329,237,00029,982,0002,404,352
3Sep 9, 2024 16:3541,4321,396,546,3821,335,258,00031,982,0002,424,832