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 listNov 12, 2025 03:50Aniruddha DebAniruddha DebScore: 14,756Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 12, 2025 03:5014,656504,461,496420,835,00062,826,0002,375,680
2Nov 12, 2025 03:5014,756514,542,168427,068,00059,869,0002,428,928
3Nov 12, 2025 03:5014,874521,118,027436,966,00053,872,0002,510,848