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 16, 2025 10:57AndreiAndreiScore: 94,721Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 16, 2025 10:5794,1843,135,833,6982,995,152,000112,930,0002,441,216
2Dec 16, 2025 10:5794,7213,149,609,3033,033,814,00091,964,0002,543,616
3Dec 16, 2025 10:5795,7843,194,039,3103,053,936,000106,927,0002,297,856