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 listJan 7, 2026 22:59Josu San MartinJosu San MartinScore: 15,033Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2026 22:3713,927485,061,854457,583,0002,002,0002,306,048
2Jan 7, 2026 22:3714,526506,279,669476,370,0002,996,0002,351,104
3Jan 7, 2026 22:5914,901521,909,144490,721,000999,0002,289,664
4Jan 7, 2026 22:3715,033524,233,504493,103,0003,000,0002,289,664
5Jan 7, 2026 22:5915,441540,630,412507,544,0001,998,0002,338,816
6Jan 7, 2026 22:5916,501575,241,191541,544,0002,997,0002,289,664