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 listAug 31, 2022 16:33Bernard TeoBernard TeoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2022 16:3300000Error: expected "1018214 ", got "1018212"
2Aug 31, 2022 16:3300000Error: expected "1020075 ", got "1020072"
3Aug 31, 2022 16:3300000Error: expected "1024085 ", got "1024084"
4Aug 31, 2022 16:3300000Error: expected "1019169 ", got "1019168"
5Aug 31, 2022 16:3300000Error: expected "1026194 ", got "1026193"
6Aug 31, 2022 16:333,164162,110,784104,408,20902,174,976
7Aug 31, 2022 16:333,178169,101,429104,862,58702,297,856
8Aug 31, 2022 16:333,179169,549,256104,908,26502,293,760
9Aug 31, 2022 16:333,214163,045,676106,069,15902,289,664
10Aug 31, 2022 16:333,216173,217,882106,129,75602,297,856
11Aug 31, 2022 16:333,241180,144,869106,958,07002,289,664