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 09:20NoSIMD_C#NoSIMD_C#Score: 88,662Success
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 09:2086,9152,898,543,3632,816,217,00051,967,0002,527,232
2Feb 6, 2025 09:2088,6622,960,726,9252,876,894,00048,964,0002,539,520
3Feb 6, 2025 09:2097,2223,246,748,1223,166,360,00041,965,0002,465,792