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 29, 2022 17:18eldon-chungeldon-chungScore: 39,527Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2022 17:1838,5881,337,707,9591,273,416,63002,285,568
2Aug 29, 2022 17:1838,6511,349,933,3061,275,491,80102,293,760
3Aug 29, 2022 17:1838,8551,344,348,7771,282,219,16902,293,760
4Aug 29, 2022 17:1839,5271,379,796,2731,304,378,66902,289,664
5Aug 29, 2022 17:1839,5351,360,977,3191,304,667,65402,285,568
6Aug 29, 2022 17:1839,7651,368,332,4191,312,232,44202,285,568