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 listMar 14, 2026 15:33limanjun99limanjun99Score: 23,850Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 15:1422,835778,571,022748,570,0004,997,0002,506,752
2Mar 14, 2026 15:1423,311797,834,972764,282,0004,995,0002,301,952
3Mar 14, 2026 15:3323,699808,034,196778,057,0004,000,0002,408,448
4Mar 14, 2026 15:3323,850814,381,833780,075,0006,991,0002,506,752
5Mar 14, 2026 15:3324,185824,859,016792,127,0005,993,0002,494,464
6Mar 14, 2026 15:1427,262930,118,626895,642,0003,998,0002,392,064