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 22, 2025 15:26Josu San MartinJosu San MartinScore: 58,609Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 15:2658,4391,956,879,7861,875,522,00052,958,0002,355,200
2Dec 22, 2025 15:2658,6091,962,767,3561,886,124,00047,977,0002,510,848
3Dec 22, 2025 15:2659,7572,002,547,5711,924,029,00047,950,0002,285,568