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 9, 2026 13:50Alexander KrivolapovAlexander KrivolapovScore: 129,540Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 9, 2026 13:50125,9264,186,841,1103,988,683,000166,861,0002,285,568
2Mar 9, 2026 13:50129,5404,306,405,3474,134,912,000139,895,0002,285,568
3Mar 9, 2026 13:50131,0814,351,706,6554,146,824,000178,863,0002,457,600