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 4, 2021 20:25Yuriy LyfenkoYuriy LyfenkoScore: 18,520Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2021 20:2517,9411,650,218,963592,058,79002,244,608
2Jun 4, 2021 20:2518,0181,650,572,512594,610,04502,244,608
3Jun 4, 2021 20:2518,1591,662,569,163599,256,81402,236,416
4Jun 4, 2021 20:2518,5201,675,135,650611,172,98902,236,416
5Jun 4, 2021 20:2518,6151,671,706,497614,290,51002,236,416
6Jun 4, 2021 20:2518,6301,663,471,273614,782,09702,248,704