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 19, 2026 08:37Dominique GarmierDominique GarmierScore: 60,092Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 08:3757,0714,427,407,193945,644,000937,698,0002,490,368
2Mar 19, 2026 08:3760,0924,806,882,196993,633,000989,414,0002,551,808
3Mar 19, 2026 08:3764,7565,539,104,0831,030,184,0001,106,766,0002,334,720