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 11, 2025 11:49Rajarshi BasuRajarshi BasuScore: 140,558Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 11, 2025 11:49139,9524,647,445,4964,598,417,00019,984,0002,424,832
2Dec 11, 2025 11:49140,5584,667,741,2834,621,430,00016,986,0002,506,752
3Dec 11, 2025 11:49141,6424,699,745,2194,652,205,00021,982,0002,473,984