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 8, 2025 07:55NoSIMD_C#NoSIMD_C#Score: 89,107Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 8, 2025 07:5586,8982,900,532,7942,816,653,00050,975,0002,326,528
2Apr 8, 2025 07:5589,1072,970,424,6072,887,568,00052,973,0002,371,584
3Apr 8, 2025 07:5589,5002,982,646,5122,901,538,00051,973,0002,473,984