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 01:35Victor MerckléVictor MerckléScore: 4,809Success
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 01:354,797165,904,193121,658,00036,645,0002,113,536
2Jun 27, 2026 01:354,801165,905,260121,547,00036,894,0002,113,536
3Jun 27, 2026 01:354,802166,434,524121,813,00036,656,0002,113,536
4Jun 27, 2026 01:354,802167,923,304121,859,00036,620,0002,113,536
5Jun 27, 2026 01:354,809166,758,823121,956,00036,750,0002,113,536
6Jun 27, 2026 01:354,812166,384,396122,119,00036,695,0002,113,536
7Jun 27, 2026 01:354,822166,888,848122,356,00036,801,0002,113,536
8Jun 27, 2026 01:354,832167,480,537122,756,00036,702,0002,113,536
9Jun 27, 2026 01:354,838167,226,120122,846,00036,828,0002,113,536