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 listJan 24, 2025 08:50NoSIMD_C#NoSIMD_C#Score: 89,201Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 24, 2025 08:5086,7732,889,320,7412,816,523,00046,975,0002,334,720
2Jan 24, 2025 08:5089,2012,971,206,5122,901,649,00041,980,0002,502,656
3Jan 24, 2025 08:5089,5282,986,737,8922,906,459,00047,974,0002,367,488