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:46NoSIMD_C#NoSIMD_C#Score: 135,018Success
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:46134,0494,455,598,7854,405,628,00017,990,0002,371,584
2Dec 15, 2024 16:46135,0184,485,484,2774,432,620,00022,987,0002,490,368
3Dec 15, 2024 16:46135,1244,491,170,4854,436,122,00022,985,0002,392,064