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 20:21zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 00:47Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 00:47011,303,6781,042,0002,164,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 00:47011,396,3121,048,0002,200,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 00:47011,044,4781,043,0002,126,0002,121,728expected "16384 ", got "349 "stderr
4Jan 1, 2026 20:193,424137,956,653111,008,0002,000,0002,531,328
5Jan 1, 2026 20:193,511140,155,570114,853,000998,0002,273,280
6Jan 1, 2026 20:213,527143,334,937115,375,0001,003,0002,420,736
7Jan 1, 2026 20:213,532139,792,112114,560,0002,009,0002,273,280
8Jan 1, 2026 20:213,578139,955,266116,073,0002,001,0002,506,752
9Jan 1, 2026 20:193,668145,337,787120,059,0001,000,0002,416,640