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 26, 2022 12:29Bernard 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 26, 2022 12:3000000Error: expected "1020603 ", got "1020602"
2Aug 26, 2022 12:2910,292409,302,558339,622,89202,277,376
3Aug 26, 2022 12:3010,317401,113,686340,471,18902,277,376
4Aug 26, 2022 12:3010,334401,547,331341,012,86902,285,568
5Aug 26, 2022 12:2910,347397,815,880341,450,96802,277,376
6Aug 26, 2022 12:2910,423422,881,564343,944,05002,289,664
7Aug 26, 2022 12:3010,698413,201,481353,038,10402,285,568