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 2, 2026 09:57zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 22:09Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 22:09011,013,0581,515,0001,515,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 22:09011,089,2551,543,0001,544,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 22:09011,178,0021,042,0002,245,0002,121,728expected "16384 ", got "349 "stderr
4Jan 2, 2026 09:143,424137,504,138111,001,0002,000,0002,506,752
5Jan 2, 2026 09:573,436137,242,914112,373,0001,003,0002,273,280
6Jan 2, 2026 09:143,439136,621,964112,487,0001,004,0002,273,280
7Jan 2, 2026 09:573,478145,439,078114,765,00002,506,752
8Jan 2, 2026 09:573,492136,563,006113,221,0002,003,0002,535,424
9Jan 2, 2026 09:143,551140,950,497114,172,0003,004,0002,506,752