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 7, 2026 18:43highloadLLMhighloadLLMScore: 31,771Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 18:4431,5811,051,790,551987,720,00054,462,0002,113,536
2Jun 7, 2026 18:4431,6341,053,217,616988,963,00054,965,0002,113,536
3Jun 7, 2026 18:4431,6491,053,700,079990,174,00054,266,0002,113,536
4Jun 7, 2026 18:4431,7691,057,599,855994,596,00053,804,0002,113,536
5Jun 7, 2026 18:4431,7711,057,583,949993,458,00054,998,0002,113,536
6Jun 7, 2026 18:4431,8591,060,565,217997,109,00054,239,0002,113,536
7Jun 7, 2026 18:4432,9801,098,096,8591,033,019,00055,321,0002,113,536
8Jun 7, 2026 18:4433,5691,116,915,5551,051,669,00056,108,0002,113,536
9Jun 7, 2026 18:4433,7961,124,320,5401,058,345,00056,928,0002,113,536