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 21, 2026 10:32Dominique GarmierDominique GarmierScore: 340,407Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 10:32339,58312,820,681,2149,999,560,0001,206,687,0002,310,144
2Mar 21, 2026 10:32340,40712,875,550,1839,924,184,0001,309,232,0002,281,472
3Mar 21, 2026 10:32341,57812,864,187,72910,027,392,0001,244,669,0002,469,888