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 29, 2022 10:34Bernard 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 29, 2022 10:3400000Error: expected "1024777 ", got "1024776"
2Aug 29, 2022 10:3400000Error: expected "1024439 ", got "1024438"
3Aug 29, 2022 10:349,836376,412,143324,598,41902,297,856
4Aug 29, 2022 10:349,871384,269,749325,753,11402,289,664
5Aug 29, 2022 10:349,885381,271,752326,192,92802,289,664
6Aug 29, 2022 10:349,945400,301,502328,190,05202,293,760
7Aug 29, 2022 10:349,953392,055,767328,442,05802,293,760
8Aug 29, 2022 10:3410,179402,508,154335,911,09902,293,760