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, 2023 18:00avdglavdglScore: 119,054Success
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, 2023 18:00118,8893,986,250,7073,923,348,10702,256,896
2Feb 26, 2023 18:00119,0544,000,086,2193,928,778,28302,232,320
3Feb 26, 2023 18:00120,7354,061,668,4653,984,248,40002,289,664