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 listSep 27, 2026 19:20Necdet Can SönmezNecdet Can SönmezScore: 194,047Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2026 19:22192,3746,359,796,6846,298,066,00050,292,0002,113,536
2Sep 27, 2026 19:22194,0476,414,880,9646,352,369,00051,188,0002,113,536
3Sep 27, 2026 19:22194,3706,425,448,0926,357,775,00056,459,0002,113,536