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 16:58Ian MckibbenIan MckibbenScore: 15,453Success
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 16:5815,394531,138,273436,013,00072,002,0002,314,240
2Jun 22, 2025 16:5815,453535,516,379424,948,00084,989,0002,310,144
3Jun 22, 2025 16:5816,200561,380,951459,651,00074,943,0002,318,336