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 21, 2026 16:06Dominique GarmierDominique GarmierScore: 25,965Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 16:4225,823883,594,556844,173,0007,992,0002,416,640
2Mar 21, 2026 16:0625,887879,435,888845,291,0008,992,0002,363,392
3Mar 21, 2026 16:4225,889888,457,655844,359,0009,992,0002,330,624
4Mar 21, 2026 16:0625,965881,944,496843,840,00012,997,0002,473,984
5Mar 21, 2026 16:0626,042884,935,698850,394,0008,993,0002,404,352
6Mar 21, 2026 16:4226,368895,791,152860,150,0009,990,0002,424,832