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 27, 2026 17:04Victor MerckléVictor MerckléScore: 4,729Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 17:054,720163,613,983119,272,00036,520,0002,113,536
2Jun 27, 2026 17:054,723163,665,625119,272,00036,592,0002,113,536
3Jun 27, 2026 17:054,724163,739,841118,941,00036,971,0002,113,536
4Jun 27, 2026 17:054,727163,710,536119,176,00036,816,0002,113,536
5Jun 27, 2026 17:054,729164,274,913119,108,00036,977,0002,113,536
6Jun 27, 2026 17:054,729163,885,460119,090,00036,991,0002,113,536
7Jun 27, 2026 17:054,749164,468,359119,841,00036,890,0002,113,536
8Jun 27, 2026 17:054,752164,623,766120,124,00036,720,0002,113,536
9Jun 27, 2026 17:054,756164,773,145120,010,00036,959,0002,113,536