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 listDec 31, 2025 07:57Aman | अमनAman | अमनScore: 322,217Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 31, 2025 07:57319,59310,580,602,58810,502,585,00043,973,0002,273,280
2Dec 31, 2025 07:57322,21710,669,355,83810,588,203,00044,971,0002,297,856
3Dec 31, 2025 07:57324,00810,724,303,38510,645,295,00046,966,0002,375,680