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 14:49Rajarshi BasuRajarshi BasuScore: 4,877Success
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 14:494,855189,253,243157,198,0003,003,0002,285,568
2Dec 22, 2025 14:494,868193,278,444157,661,0002,993,0002,281,472
3Dec 22, 2025 14:494,873183,250,877157,815,0002,996,0002,383,872
4Dec 22, 2025 14:494,877184,551,638157,927,0002,998,0002,285,568
5Dec 22, 2025 14:494,883182,477,458159,153,0002,001,0002,396,160
6Dec 22, 2025 14:494,921191,978,630160,392,0002,004,0002,387,968