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 23, 2026 00:51Victor MerckléVictor MerckléScore: 4,967Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 00:524,952170,985,677126,624,00036,823,0002,113,536
2Jun 23, 2026 00:524,954170,934,737126,600,00036,896,0002,113,536
3Jun 23, 2026 00:524,957171,708,026126,496,00037,102,0002,113,536
4Jun 23, 2026 00:524,964171,326,456126,273,00037,551,0002,113,536
5Jun 23, 2026 00:524,967171,569,937127,140,00036,776,0002,113,536
6Jun 23, 2026 00:524,973172,000,919127,403,00036,728,0002,113,536
7Jun 23, 2026 00:524,989172,089,923126,805,00037,844,0002,113,536
8Jun 23, 2026 00:524,989172,679,159126,650,00037,995,0002,113,536
9Jun 23, 2026 00:525,003172,990,928127,150,00037,975,0002,113,536