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 06:34Victor MerckléVictor MerckléScore: 4,950Success
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 06:354,936170,437,884126,136,00036,776,0002,113,536
2Jun 24, 2026 06:354,936170,477,315126,120,00036,776,0002,113,536
3Jun 24, 2026 06:354,941170,617,815126,234,00036,828,0002,113,536
4Jun 24, 2026 06:354,948171,249,844126,402,00036,906,0002,113,536
5Jun 24, 2026 06:354,950170,921,334125,632,00037,724,0002,113,536
6Jun 24, 2026 06:354,960171,214,276125,806,00037,880,0002,113,536
7Jun 24, 2026 06:354,967172,163,166125,816,00038,124,0002,113,536
8Jun 24, 2026 06:354,967171,946,513126,293,00037,632,0002,113,536
9Jun 24, 2026 06:354,972172,102,023126,380,00037,701,0002,113,536