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 22, 2026 19:26SneedSneedScore: 121,138Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2026 19:26120,8604,023,008,0013,945,385,00042,982,0002,510,848
2Feb 22, 2026 19:26121,1384,026,387,5803,954,596,00042,973,0002,285,568
3Feb 22, 2026 19:26121,2374,033,370,1273,952,839,00047,973,0002,400,256