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 listApr 4, 2025 19:53NoSIMD_C#NoSIMD_C#Score: 99,516Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 4, 2025 19:5399,3973,316,040,6693,225,148,00054,951,0002,457,600
2Apr 4, 2025 19:5399,5163,316,690,7243,235,054,00048,970,0002,555,904
3Apr 4, 2025 19:5399,5253,311,615,1073,242,336,00041,978,0002,400,256