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 06:05Rajarshi BasuRajarshi BasuScore: 11,712Success
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 06:0511,576406,098,491372,019,00010,000,0002,371,584
2Dec 22, 2025 06:0511,712412,938,701383,516,0002,996,0002,277,376
3Dec 22, 2025 06:0511,804416,122,057381,554,0007,990,0002,273,280