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 listJul 3, 2023 19:35Anılcan GülkayaAnılcan GülkayaScore: 74,078Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2023 19:3572,4202,444,686,0732,389,848,75402,314,240
2Jul 3, 2023 19:3574,0782,523,032,2882,444,573,41002,195,456
3Jul 3, 2023 19:3576,0012,575,310,0202,508,017,94502,310,144