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 listOct 5, 2026 01:27FrederickFrederickError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 01:2701,405,175,8981,390,876,0003,005,0002,113,536expected "1021456 ", got "38464039706998834 "
2Oct 5, 2026 01:2701,396,707,4161,385,220,0001,001,0002,117,632expected "1024029 ", got "38461757379909971 "
3Oct 5, 2026 01:2701,399,296,0891,387,131,0001,003,0002,113,536expected "1018583 ", got "38387574952594785 "