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 listNov 10, 2026 17:10SabadonSabadonScore: 60,967Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Nov 12, 2026 03:41Andrew Epstein16.40CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 10, 2026 17:1060,9352,020,035,6651,967,310,00043,576,0002,117,632
2Nov 10, 2026 17:1060,9672,021,016,9961,967,865,00044,052,0002,117,632
3Nov 10, 2026 17:1061,2612,030,747,4721,976,912,00044,705,0002,117,632