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 listApr 26, 2026 07:34limanjun99limanjun99Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 07:350295,888,738217,569,00062,875,0002,338,816expected "1022602 ", got "1022602back:183203492,front:597809868,"
2Apr 26, 2026 07:350297,777,018218,235,00062,066,0002,420,736expected "1023808 ", got "1023808back:184033748,front:598662244,"
3Apr 26, 2026 07:350299,207,323217,966,00061,990,0002,347,008expected "1022162 ", got "1022162back:184433964,front:598133896,"