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 listJun 7, 2026 18:32anboto1anboto1Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 18:32010,923,99001,563,0002,121,728expected "1025670 ", got "dir: open_failed read: "
2Jun 7, 2026 18:32010,793,73001,565,0002,121,728expected "1018450 ", got "dir: open_failed read: "
3Jun 7, 2026 18:32011,035,89201,582,0002,121,728expected "1024775 ", got "dir: open_failed read: "