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 listDec 31, 2025 20:18Павел РатмановПавел РатмановScore: 102,054Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 31, 2025 20:18101,9543,399,718,1093,343,500,00020,984,0002,392,064
2Dec 31, 2025 20:18102,0543,399,632,9393,345,813,00021,985,0002,478,080
3Dec 31, 2025 20:18102,2273,403,759,2483,352,502,00020,990,0002,396,160