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 24, 2026 09:04Victor MerckléVictor MerckléScore: 4,852Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 09:054,835167,570,477122,676,00036,908,0002,113,536
2Jun 24, 2026 09:054,839167,364,976122,888,00036,801,0002,113,536
3Jun 24, 2026 09:054,841167,613,643122,274,00037,506,0002,113,536
4Jun 24, 2026 09:054,847167,444,119122,423,00037,545,0002,113,536
5Jun 24, 2026 09:054,852167,591,479122,342,00037,802,0002,113,536
6Jun 24, 2026 09:054,861168,050,230123,688,00036,747,0002,113,536
7Jun 24, 2026 09:054,864168,111,539122,888,00037,630,0002,113,536
8Jun 24, 2026 09:054,865168,425,234122,831,00037,724,0002,113,536
9Jun 24, 2026 09:054,877168,387,033123,296,00037,656,0002,113,536