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 3, 2024 17:50Jatin YadavJatin YadavScore: 56,343Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2024 17:5056,0731,878,655,4601,842,397,0007,997,0002,498,560
2Sep 3, 2024 17:5056,3431,886,454,6961,850,316,0008,996,0002,338,816
3Sep 3, 2024 17:5062,0152,074,256,6672,036,512,0009,992,0002,514,944