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 listAug 23, 2025 09:37Adam FolwarcznyAdam FolwarcznyScore: 125,188Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2025 09:37124,9134,152,817,1864,055,161,00066,969,0002,326,528
2Aug 23, 2025 09:37125,1884,162,633,1594,062,245,00068,953,0002,318,336
3Aug 23, 2025 09:37125,2994,170,758,2484,080,909,00053,972,0002,310,144