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 5, 2026 20:49olliecrowolliecrowScore: 14,443Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 5, 2026 20:4914,398497,659,677467,142,0008,002,0002,326,528
2Mar 5, 2026 20:3714,410499,716,374466,550,0008,991,0002,281,472
3Mar 5, 2026 20:3714,412503,749,882468,575,0007,008,0002,318,336
4Mar 5, 2026 20:4914,443499,820,803467,628,0008,992,0002,383,872
5Mar 5, 2026 20:4914,493501,242,958470,272,0008,004,0002,359,296
6Mar 5, 2026 20:3714,554508,204,285471,270,0009,005,0002,514,944