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 14:07Bernard TeoBernard TeoScore: 15,535Success
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 14:0715,496582,189,358511,369,74902,281,472
2Aug 25, 2022 14:4315,505581,730,074511,663,01402,265,088
3Aug 25, 2022 14:0715,510572,657,682511,830,07202,277,376
4Aug 25, 2022 14:4315,535573,833,899512,648,10002,289,664
5Aug 25, 2022 14:4315,630587,785,431515,782,81302,281,472
6Aug 25, 2022 14:0715,696578,852,868517,976,88302,281,472