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 listSep 25, 2026 15:07Mark KorneychikMark KorneychikScore: 86,269Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2026 15:0885,8042,841,886,8112,691,313,000140,251,0002,117,632
2Sep 25, 2026 15:0886,2692,857,586,8942,705,657,000141,238,0002,121,728
3Sep 25, 2026 15:0889,2392,955,359,3512,803,675,000141,240,0002,117,632