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 9, 2025 17:32NoSIMD_C#NoSIMD_C#Score: 88,719Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2025 17:3287,9382,931,402,7382,833,999,00067,952,0002,555,904
2Apr 9, 2025 17:3288,7192,957,463,5772,883,739,00043,980,0002,301,952
3Apr 9, 2025 17:3289,1002,967,488,0342,882,333,00057,966,0002,363,392