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 20, 2026 23:43Taylor DettlingTaylor DettlingError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 23:440557,151,278529,287,0001,000,0002,297,856expected "1022545 ", got "16618293620 "
2Apr 20, 2026 23:440558,670,014527,601,0001,998,0002,293,760expected "1017969 ", got "16695497535 "
3Apr 20, 2026 23:440553,600,179529,097,0001,000,0002,289,664expected "1024145 ", got "16828561042 "