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 02:42highloadLLMhighloadLLMScore: 14,989Success
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 02:4314,927501,911,855381,545,000111,065,0002,113,536
2Jun 8, 2026 02:4314,950502,533,861380,218,000113,148,0002,113,536
3Jun 8, 2026 02:4314,986503,857,170380,369,000114,190,0002,113,536
4Jun 8, 2026 02:4314,986503,669,097381,691,000112,879,0002,113,536
5Jun 8, 2026 02:4314,989503,697,066381,353,000113,307,0002,113,536
6Jun 8, 2026 02:4315,006504,308,729382,640,000112,581,0002,113,536
7Jun 8, 2026 02:4315,011504,537,742381,630,000113,740,0002,113,536
8Jun 8, 2026 02:4315,011504,668,620381,535,000113,858,0002,113,536
9Jun 8, 2026 02:4315,071506,460,908382,701,000114,659,0002,113,536