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 13:41Bernard TeoBernard TeoScore: 7,844Success
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 13:417,189303,305,422237,249,40502,285,568
2Aug 29, 2022 13:427,222303,207,286238,331,88502,297,856
3Aug 29, 2022 13:427,299303,755,473240,883,24302,297,856
4Aug 29, 2022 13:417,822329,818,847258,120,28102,301,952
5Aug 29, 2022 13:417,844337,109,779258,840,26002,289,664
6Aug 29, 2022 13:417,855330,213,269259,200,30102,289,664
7Aug 29, 2022 13:427,921321,555,202261,408,06602,289,664
8Aug 29, 2022 13:417,932314,116,932261,770,38002,293,760
9Aug 29, 2022 13:417,976320,372,311263,210,87802,289,664