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:47highloadLLMhighloadLLMScore: 24,738Success
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:4824,563819,878,239754,680,00055,907,0002,113,536
2Jun 7, 2026 18:4824,633822,080,257756,917,00055,977,0002,113,536
3Jun 7, 2026 18:4824,706824,598,871760,482,00054,839,0002,113,536
4Jun 7, 2026 18:4824,734825,524,430760,944,00055,278,0002,113,536
5Jun 7, 2026 18:4824,738825,596,410761,308,00055,061,0002,113,536
6Jun 7, 2026 18:4824,754827,590,265760,492,00056,421,0002,113,536
7Jun 7, 2026 18:4824,763826,399,132761,711,00055,478,0002,113,536
8Jun 7, 2026 18:4824,851829,228,212763,295,00056,820,0002,113,536
9Jun 7, 2026 18:4824,932831,957,997767,589,00055,180,0002,113,536