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 listDec 5, 2025 09:50CadovvlCadovvlScore: 286,376Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 5, 2025 09:50285,2119,438,898,7319,340,013,00071,961,0002,478,080
2Dec 5, 2025 09:50286,3769,482,204,7609,386,439,00063,962,0002,506,752
3Dec 5, 2025 09:50289,7889,598,123,7199,490,063,00072,954,0002,322,432