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 10:13Mikhail MaximovMikhail MaximovScore: 255,704Success
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 10:13254,9918,480,795,1448,414,687,40902,224,128
2Jun 1, 2021 10:13255,7048,487,313,2388,438,225,71502,318,336
3Jun 1, 2021 10:13257,8628,563,338,2228,509,447,55402,228,224