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 listFeb 6, 2025 10:27NoSIMD_C#NoSIMD_C#Score: 87,250Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 6, 2025 10:2786,4702,884,935,5772,800,535,00052,972,0002,404,352
2Feb 6, 2025 10:2787,2502,913,688,5612,831,270,00047,970,0002,482,176
3Feb 6, 2025 10:2788,5202,947,197,7912,869,200,00051,967,0002,400,256