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 listSep 22, 2024 07:35Alex KentAlex KentScore: 58,354Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 22, 2024 07:3557,8931,936,329,2481,891,483,00018,994,0002,293,760
2Sep 22, 2024 07:3558,3541,954,775,2121,899,705,00025,982,0002,273,280
3Sep 22, 2024 07:3558,5021,959,815,6901,903,572,00026,979,0002,273,280