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 01:29anboto1anboto1Error
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 01:300326,875,944305,765,00011,877,0002,117,632expected "1024179 ", got "1024179 785363860 315867736 2316058 2319296 2321598 2315691 2309281 2307982 2301218 2317502 2326316 2310768 2325179 "
2Jun 8, 2026 01:300340,025,346318,139,00012,183,0002,117,632expected "1023387 ", got "1023387 825569504 320620532 2327527 2313126 2306376 2332257 2312886 2309846 2308819 2312277 2300011 2311848 2318151 "
3Jun 8, 2026 01:300332,583,461310,987,00012,089,0002,117,632expected "1020277 ", got "1020277 799791508 320056376 2320653 2310923 2306052 2321672 2322890 2324430 2321307 2307788 2308736 2310173 2297133 "