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 23, 2025 08:45NoSIMD_C#NoSIMD_C#Score: 92,599Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2025 08:4592,3553,080,530,3553,000,724,00046,980,0002,424,832
2Jan 23, 2025 08:4592,5993,080,863,4333,013,771,00041,982,0002,359,296
3Jan 23, 2025 08:4593,2203,104,317,3753,027,317,00048,956,0002,371,584