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 listMay 13, 2026 14:44Pavel SkripkinPavel SkripkinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 14:440424,740,096413,598,0002,629,0002,117,632expected "1020783 ", got "1020540 "
2May 13, 2026 14:440467,821,158456,129,0002,376,0002,117,632expected "1023097 ", got "1022850 "
3May 13, 2026 14:440452,917,551439,014,0002,753,0002,117,632expected "1021303 ", got "1021044 "