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 11, 2025 07:26CadovvlCadovvlScore: 252,087Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2025 07:26251,8348,347,165,8668,286,543,00023,987,0002,338,816
2Feb 11, 2025 07:26252,0878,350,759,0878,292,889,00025,983,0002,404,352
3Feb 11, 2025 07:26253,3528,395,276,4388,334,634,00025,983,0002,469,888