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:43NoSIMD_C#NoSIMD_C#Score: 139,606Success
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:43139,0574,620,047,0434,519,933,00068,953,0002,387,968
2Dec 15, 2024 16:43139,6064,641,177,7104,544,031,00062,958,0002,363,392
3Dec 15, 2024 16:43140,1484,655,302,5124,553,935,00070,952,0002,322,432