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 22, 2026 19:44SneedSneedScore: 103,351Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2026 19:44102,6573,416,452,9333,338,691,00048,980,0002,478,080
2Feb 22, 2026 19:44103,3513,435,880,8153,358,619,00051,978,0002,285,568
3Feb 22, 2026 19:44104,2383,469,925,7623,384,880,00054,965,0002,486,272