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 16:07Ian MckibbenIan MckibbenScore: 198,173Success
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 16:07196,5316,513,268,2466,463,534,00021,988,0002,396,160
2Jun 23, 2025 16:07198,1736,574,327,1046,513,736,00025,979,0002,363,392
3Jun 23, 2025 16:07200,1956,639,458,0786,580,460,00025,982,0002,310,144