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 2, 2025 07:13korsajankorsajanScore: 109,561Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2025 07:13107,8673,588,977,6723,508,649,00050,965,0002,330,624
2Feb 2, 2025 07:13108,1053,598,826,9353,504,495,00062,972,0002,330,624
3Feb 2, 2025 07:13109,5603,644,429,0633,576,495,00038,994,0002,494,464
4Feb 2, 2025 07:13109,5613,649,764,2553,568,555,00046,967,0002,330,624
5Feb 2, 2025 07:13109,6703,652,547,3233,569,134,00049,973,0002,420,736
6Feb 2, 2025 07:13109,7743,647,814,9003,567,578,00054,962,0002,494,464