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:56CadovvlCadovvlScore: 333,719Success
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:56329,69910,916,384,52810,831,103,00048,968,0002,379,776
2Feb 10, 2025 14:56333,71911,054,885,43410,959,748,00052,964,0002,469,888
3Feb 10, 2025 14:56339,87011,259,205,27411,164,778,00050,944,0002,281,472