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 18, 2026 01:53M-RochatM-RochatScore: 18,770Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 01:5518,555622,096,788609,319,0003,009,0002,113,536
2May 18, 2026 01:5518,612625,881,759610,173,0004,036,0002,113,536
3May 18, 2026 01:5518,636624,926,809612,009,0003,010,0002,113,536
4May 18, 2026 01:5518,755631,562,148614,928,0004,013,0002,113,536
5May 18, 2026 01:5518,770630,533,386615,409,0004,031,0002,113,536
6May 18, 2026 01:5518,794630,893,998617,215,0003,011,0002,113,536
7May 18, 2026 01:5518,935636,679,388620,838,0004,042,0002,113,536
8May 18, 2026 01:5518,940634,896,043621,024,0004,026,0002,113,536
9May 18, 2026 01:5520,054672,297,448657,648,0004,138,0002,113,536