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 listNov 11, 2024 10:11NoSIMD_C#NoSIMD_C#Score: 549,608Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 10:11545,41518,035,362,80617,846,809,000151,887,0002,306,048
2Nov 11, 2024 10:11549,60818,176,552,21517,967,217,000169,860,0002,310,144
3Nov 11, 2024 10:11550,66018,214,532,70318,021,887,000149,899,0002,330,624