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 23:18highloadLLMhighloadLLMScore: 24,422Success
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 23:2224,367813,325,001764,372,00039,752,0002,113,536
2Jun 7, 2026 23:2224,402815,306,492764,667,00040,607,0002,113,536
3Jun 7, 2026 23:2224,408814,651,642765,530,00039,960,0002,113,536
4Jun 7, 2026 23:2224,413814,924,203765,957,00039,682,0002,113,536
5Jun 7, 2026 23:2224,422818,576,367766,210,00039,743,0002,113,536
6Jun 7, 2026 23:2224,445815,948,557766,441,00040,274,0002,113,536
7Jun 7, 2026 23:2224,480817,054,536767,387,00040,457,0002,113,536
8Jun 7, 2026 23:2224,507817,908,922768,335,00040,400,0002,113,536
9Jun 7, 2026 23:2224,610821,371,332772,137,00040,001,0002,113,536