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 listJun 18, 2021 21:38alex3dalex3dScore: 57,604Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2021 21:3857,5521,966,508,1081,899,204,99602,289,664
2Jun 18, 2021 21:3857,6041,978,715,5621,900,935,91702,240,512
3Jun 18, 2021 21:3857,6471,986,799,9441,902,365,48902,215,936