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 listMar 23, 2026 23:07Dominique GarmierDominique GarmierScore: 50,853Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 23:0750,4841,692,638,0651,656,974,0008,994,0002,342,912
2Mar 23, 2026 23:0750,8531,706,194,4731,667,149,00010,994,0002,539,520
3Mar 23, 2026 23:0754,1151,812,317,5061,778,799,0006,995,0002,330,624