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 18, 2026 22:14Dominique GarmierDominique GarmierScore: 40,016Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 22:1439,1811,319,582,1191,285,992,0006,994,0002,359,296
2Mar 18, 2026 22:1440,0161,353,303,0731,316,521,0003,998,0002,281,472
3Mar 18, 2026 22:1445,4531,523,429,3961,493,946,0005,995,0002,285,568