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 listMar 22, 2026 03:17olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 06:13C#_user10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 06:160142,418,248120,702,00010,410,0002,138,112expected "1000033 ", got "846839 "stderr
2Sep 9, 2026 06:160143,506,853121,011,00010,698,0002,138,112expected "1000033 ", got "846839 "stderr
3Sep 9, 2026 06:160134,745,929114,452,00010,330,0002,138,112expected "1000033 ", got "846839 "stderr
4Mar 22, 2026 03:1712,832452,523,651414,433,0009,009,0002,428,928
5Mar 22, 2026 03:1712,845445,263,303411,932,00011,968,0002,306,048
6Mar 22, 2026 03:1713,187471,906,551421,175,00014,005,0002,490,368