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 23, 2025 17:32Ian MckibbenIan MckibbenScore: 20,551Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2025 17:3220,492697,424,285592,345,00083,907,0002,433,024
2Jun 23, 2025 17:3220,551703,273,849598,284,00079,904,0002,310,144
3Jun 23, 2025 17:3220,597701,529,529613,741,00065,972,0002,301,952