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 7, 2025 21:42E SequeiraE SequeiraScore: 81,650Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2025 21:4281,3132,709,775,6772,656,330,00026,983,0002,379,776
2Feb 7, 2025 21:4281,6502,724,513,4162,668,456,00025,984,0002,445,312
3Feb 7, 2025 21:4282,1132,743,913,8922,687,744,00021,989,0002,387,968