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 listDec 15, 2024 16:42NoSIMD_C#NoSIMD_C#Score: 138,183Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 15, 2024 16:42137,7004,571,679,3174,488,148,00055,964,0002,408,448
2Dec 15, 2024 16:42138,1834,587,396,9644,512,075,00047,968,0002,330,624
3Dec 15, 2024 16:42139,8544,649,036,8864,545,217,00069,957,0002,424,832