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 8, 2025 14:14NoSIMD_C#NoSIMD_C#Score: 102,111Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 8, 2025 14:14101,8073,390,427,1803,313,648,00045,967,0002,330,624
2Apr 8, 2025 14:14102,1113,399,041,9383,335,681,00033,976,0002,396,160
3Apr 8, 2025 14:14104,6113,484,408,1953,406,195,00045,962,0002,547,712