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 8, 2024 16:06Jatin YadavJatin YadavScore: 91,242Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2024 16:0690,7863,023,315,7172,965,952,00029,979,0002,416,640
2Sep 8, 2024 16:0691,2423,044,610,6792,984,002,00026,981,0002,416,640
3Sep 8, 2024 16:0692,8523,089,609,6173,026,135,00037,976,0002,281,472