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 9, 2026 01:47zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 06:21Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 06:21010,915,8371,030,0002,079,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 06:21010,911,5521,042,0002,132,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 06:21011,081,3981,030,0002,067,0002,121,728expected "16384 ", got "349 "stderr
4Jan 9, 2026 01:473,123129,368,261100,061,0003,001,0002,273,280
5Jan 9, 2026 01:473,138136,502,623103,562,00002,408,448
6Jan 9, 2026 01:473,196130,315,971102,448,0003,013,0002,535,424