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:50Bernard TeoBernard TeoScore: 20,211Success
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 15:5119,515718,538,306643,979,26402,265,088
2Aug 21, 2022 15:5119,719713,879,587650,740,78902,248,704
3Aug 21, 2022 15:5020,161720,164,294665,305,92302,265,088
4Aug 21, 2022 15:5020,211747,677,407666,959,09202,269,184
5Aug 21, 2022 15:5120,218733,760,640667,185,98402,256,896
6Aug 21, 2022 15:5020,325742,193,018670,715,73202,260,992