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 21, 2026 18:10M-RochatM-RochatScore: 18,826Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 18:1118,418618,278,435603,758,0004,036,0002,113,536
2May 21, 2026 18:1118,482621,502,053605,912,0004,003,0002,113,536
3May 21, 2026 18:1118,543621,631,057607,910,0004,036,0002,113,536
4May 21, 2026 18:1118,742630,215,801614,483,0004,032,0002,113,536
5May 21, 2026 18:1118,826630,735,750618,270,0003,010,0002,113,536
6May 21, 2026 18:1118,834631,377,524617,522,0004,021,0002,113,536
7May 21, 2026 18:1118,894635,435,499619,514,0004,010,0002,113,536
8May 21, 2026 18:1119,171644,066,041628,631,0004,019,0002,113,536
9May 21, 2026 18:1119,603659,336,992642,850,0004,055,0002,113,536