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 16, 2026 08:35M-RochatM-RochatScore: 28,987Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 08:3828,865962,579,915939,738,00012,812,0002,113,536
2May 16, 2026 08:3828,939964,272,685942,182,00012,808,0002,113,536
3May 16, 2026 08:3828,950967,259,484942,307,00013,073,0002,113,536
4May 16, 2026 08:3828,955964,626,251942,994,00012,550,0002,113,536
5May 16, 2026 08:3828,987968,019,843943,339,00013,257,0002,113,536
6May 16, 2026 08:3829,075969,326,280946,609,00012,880,0002,113,536
7May 16, 2026 08:3829,103969,110,509947,522,00012,888,0002,113,536
8May 16, 2026 08:3829,966999,617,958975,685,00013,199,0002,113,536
9May 16, 2026 08:3830,1001,003,116,817980,050,00013,271,0002,113,536