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 26, 2026 10:43Dominique GarmierDominique GarmierScore: 60,623Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 10:4360,3342,016,623,4171,981,032,0009,995,0002,412,544
2Mar 26, 2026 10:4360,6232,021,163,9061,990,570,0009,992,0002,514,944
3Mar 26, 2026 10:4366,9752,248,355,3872,199,184,00010,990,0002,412,544