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:14Rajarshi BasuRajarshi BasuScore: 9,254Success
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:139,168333,935,596294,544,0007,987,0002,514,944
2Dec 22, 2025 06:149,187330,652,089296,161,0007,003,0002,379,776
3Dec 22, 2025 06:139,242329,988,766296,977,0007,999,0002,457,600
4Dec 22, 2025 06:149,254334,401,678296,414,0008,982,0002,416,640
5Dec 22, 2025 06:139,294333,708,401295,712,00010,989,0002,510,848
6Dec 22, 2025 06:149,421339,646,664301,907,0008,997,0002,469,888