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 14:51Bernard TeoBernard TeoScore: 27,530Success
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:5127,308966,593,960901,173,17702,191,360
2Aug 21, 2022 14:5127,349956,635,443902,505,26902,306,048
3Aug 21, 2022 14:5127,386967,149,795903,731,31602,207,744
4Aug 21, 2022 14:5127,530960,362,980908,482,70602,187,264
5Aug 21, 2022 14:5127,687968,730,646913,670,50402,191,360
6Aug 21, 2022 14:5127,712973,519,322914,492,00202,195,456