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 21, 2022 15:06Bernard TeoBernard TeoScore: 24,540Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2022 14:5724,426873,770,522806,056,42502,183,168
2Aug 21, 2022 14:5524,429864,269,940806,147,96202,179,072
3Aug 21, 2022 14:5524,500873,086,536808,494,79502,306,048
4Aug 21, 2022 15:0624,512880,105,570808,886,78902,174,976
5Aug 21, 2022 14:5724,540873,392,721809,828,13302,174,976
6Aug 21, 2022 14:5524,584884,989,158811,255,54002,187,264
7Aug 21, 2022 15:0624,585889,472,410811,319,86202,187,264
8Aug 21, 2022 14:5724,607884,694,328812,043,64902,306,048
9Aug 21, 2022 15:0624,725894,012,620815,935,59802,301,952