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 00:53anboto1anboto1Error
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 00:540360,257,319338,490,00011,930,0002,117,632expected "1022896 ", got "1022896 904075712 314959000 2315804 2315823 2317112 2295413 2325462 2311971 2310035 2316409 2311080 2324926 2313942 "
2Jun 8, 2026 00:540366,841,311345,420,00012,200,0002,117,632expected "1019515 ", got "1019515 927147788 317221728 2328557 2324482 2318711 2308297 2304487 2306207 2303250 2315740 2332624 2322287 2306555 "
3Jun 8, 2026 00:540364,568,817342,827,00012,103,0002,117,632expected "1025100 ", got "1025100 915082580 319151556 2300093 2301812 2313286 2330085 2307244 2327365 2320939 2303834 2310302 2313621 2326094 "