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:02Bernard TeoBernard TeoScore: 10,899Success
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:0210,815423,798,979356,898,85902,277,376
2Aug 26, 2022 12:0310,834427,803,911357,535,85302,285,568
3Aug 26, 2022 12:0210,838414,807,448357,669,61702,281,472
4Aug 26, 2022 12:0310,896439,707,716359,554,38702,277,376
5Aug 26, 2022 12:0310,899425,741,558359,675,48402,281,472
6Aug 26, 2022 12:0210,903426,109,558359,812,85302,273,280
7Aug 26, 2022 12:0210,914423,808,551360,167,19102,252,800
8Aug 26, 2022 12:0210,949433,265,823361,328,21202,285,568
9Aug 26, 2022 12:0210,990429,239,254362,654,63302,281,472