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 25, 2022 16:28Bernard TeoBernard TeoScore: 15,176Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2022 16:2815,068581,260,052497,259,55902,273,280
2Aug 25, 2022 16:2815,084550,632,811497,772,51602,281,472
3Aug 25, 2022 16:2815,092549,385,609498,024,26102,285,568
4Aug 25, 2022 16:2815,098556,713,047498,238,88002,277,376
5Aug 25, 2022 16:2815,176566,952,874500,803,72502,273,280
6Aug 25, 2022 16:2815,177560,855,345500,837,26202,273,280
7Aug 25, 2022 16:2815,191564,077,504501,302,76702,269,184
8Aug 25, 2022 16:2815,222570,774,620502,324,75002,289,664
9Aug 25, 2022 16:2815,236575,508,181502,789,17602,285,568