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 10, 2026 00:49zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 07:34Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 07:35010,865,0901,035,0002,083,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 07:35011,432,0211,040,0002,102,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 07:35010,931,5271,044,0002,186,0002,121,728expected "16384 ", got "349 "stderr
4Jan 10, 2026 00:493,108128,589,396100,550,0002,011,0002,535,424
5Jan 10, 2026 00:513,126130,300,791101,140,0002,002,0002,424,832
6Jan 10, 2026 00:513,139127,613,826102,590,000996,0002,412,544
7Jan 10, 2026 00:493,160128,838,734102,271,0002,005,0002,273,280
8Jan 10, 2026 00:513,206128,416,776103,788,0001,995,0002,535,424
9Jan 10, 2026 00:493,224126,437,869105,375,0001,003,0002,416,640