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 listMay 11, 2026 09:12Victor MerckléVictor MerckléScore: 11,800Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 09:1311,716394,002,014342,768,00043,863,0002,113,536
2May 11, 2026 09:1311,720394,286,907342,996,00043,774,0002,113,536
3May 11, 2026 09:1311,733396,253,744342,936,00044,280,0002,113,536
4May 11, 2026 09:1311,748395,017,575344,210,00043,482,0002,113,536
5May 11, 2026 09:1311,800396,942,222346,697,00042,713,0002,113,536
6May 11, 2026 09:1311,807397,277,154346,827,00042,818,0002,113,536
7May 11, 2026 09:1311,819397,326,082345,609,00044,434,0002,113,536
8May 11, 2026 09:1311,824400,544,570345,855,00044,346,0002,113,536
9May 11, 2026 09:1311,830397,996,737347,118,00043,279,0002,113,536