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 1, 2021 09:39Mikhail MaximovMikhail MaximovScore: 270,252Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2021 09:39269,5738,964,891,7388,895,899,39802,248,704
2Jun 1, 2021 09:39270,2528,979,454,4088,918,316,81502,301,952
3Jun 1, 2021 09:39271,6819,020,467,3278,965,470,78602,207,744