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:41Bernard TeoBernard TeoScore: 12,000Success
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:5611,874457,385,210391,844,21602,273,280
2Aug 26, 2022 12:4411,890458,432,754392,373,98002,273,280
3Aug 26, 2022 12:4111,892455,479,892392,440,20502,285,568
4Aug 26, 2022 12:5611,955469,152,387394,518,15502,289,664
5Aug 26, 2022 12:4112,000456,857,931395,998,80202,273,280
6Aug 26, 2022 12:4412,045455,984,304397,495,86602,289,664
7Aug 26, 2022 12:4112,110466,687,312399,626,89002,281,472
8Aug 26, 2022 12:5613,143495,088,541433,709,11402,281,472
9Aug 26, 2022 12:4413,270503,830,413437,913,89102,256,896