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 16, 2024 09:40NoSIMD_C#NoSIMD_C#Score: 146,925Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 16, 2024 09:40143,6584,778,989,9294,714,717,00025,981,0002,375,680
2Dec 16, 2024 09:40146,9254,879,712,0404,827,528,00020,989,0002,314,240
3Dec 16, 2024 09:40147,7424,908,074,8914,859,507,00015,988,0002,289,664