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 25, 2026 09:24Dominique GarmierDominique GarmierScore: 34,717Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 09:2434,4991,167,252,0061,011,524,000126,940,0002,330,624
2Mar 25, 2026 09:2434,7171,168,606,6141,021,792,000123,853,0002,379,776
3Mar 25, 2026 09:2434,9251,179,977,0481,035,674,000116,850,0002,285,568