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 18:53NoSIMD_C#NoSIMD_C#Score: 92,338Success
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 18:5391,9633,066,088,4932,985,831,00048,964,0002,531,328
2Apr 4, 2025 18:5392,3383,075,181,8943,007,182,00039,975,0002,478,080
3Apr 4, 2025 18:5393,6183,116,333,9463,037,432,00051,956,0002,387,968