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 8, 2026 05:14anboto1anboto1Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 05:140190,964,147171,583,0009,620,0002,117,632expected "1021249 ", got "1021260 "
2Jun 8, 2026 05:140191,369,345172,400,0009,736,0002,117,632expected "1025369 ", got "1025386 "
3Jun 8, 2026 05:140192,585,019173,430,0009,833,0002,117,632expected "1018042 ", got "1018050 "