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 listFeb 10, 2025 14:56Oleg KovalovOleg KovalovScore: 100,496Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2025 14:56100,2813,333,414,4813,295,269,00013,992,0002,523,136
2Feb 10, 2025 14:56100,4963,343,805,5923,300,374,00015,992,0002,461,696
3Feb 10, 2025 14:56101,3333,372,304,5763,331,986,00011,992,0002,506,752