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 listMar 22, 2025 17:31Aniruddha DebAniruddha DebScore: 417,928Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2025 17:31414,69913,717,981,87613,576,148,000108,928,0002,506,752
2Mar 22, 2025 17:31417,92813,825,408,50113,680,708,000110,932,0002,506,752
3Mar 22, 2025 17:31422,66313,984,504,98513,840,973,000106,922,0002,342,912