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 16:46highloadLLMhighloadLLMScore: 26,540Success
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 16:4926,450882,149,243824,842,00048,036,0002,113,536
2Jun 7, 2026 16:4926,486883,379,550826,304,00047,764,0002,113,536
3Jun 7, 2026 16:4926,524886,376,416827,677,00047,636,0002,113,536
4Jun 7, 2026 16:4926,536884,860,010827,697,00048,009,0002,113,536
5Jun 7, 2026 16:4926,540885,115,042828,372,00047,466,0002,113,536
6Jun 7, 2026 16:4926,723891,017,916831,845,00050,046,0002,113,536
7Jun 7, 2026 16:4926,754892,099,012834,434,00048,451,0002,113,536
8Jun 7, 2026 16:4926,898896,901,211837,628,00050,027,0002,113,536
9Jun 7, 2026 16:4927,065902,329,977843,799,00049,376,0002,113,536