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 listOct 17, 2026 04:15e1011e1011Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 04:1504,647,907,4474,634,964,0002,012,0002,113,536expected "1025109 ", got "1025108 "
2Oct 17, 2026 04:1504,752,996,7024,740,150,0002,000,0002,113,536expected "1021099 ", got "1021098 "
3Oct 17, 2026 04:15140,5164,648,025,3964,634,884,0002,173,0002,113,536