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 listJun 22, 2025 06:00Ian MckibbenIan MckibbenScore: 18,527Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 06:0018,444630,873,263528,691,00079,953,0002,301,952
2Jun 22, 2025 06:0018,527633,233,955520,479,00090,909,0002,375,680
3Jun 22, 2025 06:0018,739645,614,040537,465,00080,919,0002,281,472