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 29, 2026 06:48Dominique GarmierDominique GarmierScore: 33,356Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 06:4833,2461,128,942,1441,092,102,0005,000,0002,342,912
2Mar 29, 2026 06:4833,3561,126,764,7591,095,749,0004,998,0002,359,296
3Mar 29, 2026 06:4833,5521,137,934,3801,105,223,0001,998,0002,375,680