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 7, 2026 19:38anboto1anboto1Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 19:390474,986,608450,578,00012,627,0002,117,632expected "1025004 ", got "1025004 1283281388 373626576 2310314 2317092 2317653 2312622 2293417 2324370 2314967 2319242 2316181 2316714 2305555 "
2Jun 7, 2026 19:390475,126,651452,337,00012,984,0002,117,632expected "1024187 ", got "1024187 1286761136 377562044 2323540 2317741 2319881 2310567 2313573 2316897 2294343 2292730 2345330 2318706 2305061 "
3Jun 7, 2026 19:390468,992,588446,273,00013,041,0002,117,632expected "1025894 ", got "1025894 1264443864 378107592 2311230 2306509 2313931 2314003 2313690 2302103 2330113 2310960 2325330 2335492 2293495 "