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 listJun 8, 2026 01:16highloadLLMhighloadLLMScore: 29,245Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 01:1728,561951,773,365900,141,00042,382,0002,113,536
2Jun 8, 2026 01:1728,589952,795,500902,980,00040,473,0002,113,536
3Jun 8, 2026 01:1729,016966,764,701914,471,00043,057,0002,113,536
4Jun 8, 2026 01:1729,156971,352,762920,880,00041,298,0002,113,536
5Jun 8, 2026 01:1729,245974,311,503922,753,00042,337,0002,113,536
6Jun 8, 2026 01:1729,286977,941,679923,552,00042,902,0002,113,536
7Jun 8, 2026 01:1730,0951,002,385,513950,798,00042,357,0002,113,536
8Jun 8, 2026 01:1730,1301,003,501,339951,978,00042,340,0002,113,536
9Jun 8, 2026 01:1730,6961,022,153,612970,267,00042,724,0002,113,536