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 listJan 1, 2026 18:06zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 01:40Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 01:40011,382,2401,044,0002,191,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 01:40011,334,0911,038,0002,156,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 01:40010,875,1601,041,0002,186,0002,121,728expected "16384 ", got "349 "stderr
4Jan 1, 2026 18:063,437134,804,702112,418,0001,003,0002,273,280
5Jan 1, 2026 18:063,552140,988,637114,207,0003,005,0002,535,424
6Jan 1, 2026 18:063,733152,515,631121,205,0001,986,0002,535,424