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 listMay 8, 2024 17:22Emmadi PrashanthEmmadi PrashanthScore: 329,029Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 8, 2024 17:22327,36210,867,659,47610,802,931,03302,277,376
2May 8, 2024 17:22329,02910,921,371,68610,857,962,42402,240,512
3May 8, 2024 17:22329,78910,936,670,00510,883,035,99102,207,744