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 listFeb 26, 2025 16:55AdityaAdityaScore: 366,134Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 26, 2025 16:55363,16112,017,877,53611,962,336,00021,987,0002,523,136
2Feb 26, 2025 16:55366,13412,122,136,71612,045,431,00036,976,0002,478,080
3Feb 26, 2025 16:55367,55212,165,412,06112,091,238,00037,975,0002,437,120