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 19:13Jatin YadavJatin YadavScore: 64,775Success
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 19:1364,1242,150,266,3192,105,105,00010,995,0002,514,944
2Sep 3, 2024 19:1364,7752,162,060,1242,129,586,0007,994,0002,281,472
3Sep 3, 2024 19:1367,2532,244,161,3252,207,359,00011,991,0002,519,040