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 13, 2026 18:49Pavel SkripkinPavel SkripkinScore: 11,561Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 18:5011,188376,670,367366,111,0003,120,0002,117,632
2May 13, 2026 18:5011,313382,638,457370,215,0003,127,0002,117,632
3May 13, 2026 18:5011,501386,993,893376,459,0003,106,0002,117,632
4May 13, 2026 18:5011,543388,833,263377,800,0003,142,0002,117,632
5May 13, 2026 18:5011,561388,900,197378,403,0003,127,0002,117,632
6May 13, 2026 18:5011,668392,547,998381,913,0003,151,0002,117,632
7May 13, 2026 18:5011,793396,724,014385,937,0003,260,0002,117,632
8May 13, 2026 18:5011,947401,650,688391,192,0003,072,0002,117,632
9May 13, 2026 18:5012,506422,293,819409,486,0003,236,0002,117,632