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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 03:31Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 03:31010,931,9271,042,0002,134,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 03:31010,960,3631,046,0002,266,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 03:31010,867,1051,039,0002,129,0002,121,728expected "16384 ", got "349 "stderr
4Jan 1, 2026 16:163,575142,840,412115,966,0001,999,0002,273,280
5Jan 1, 2026 16:163,595143,893,611116,618,0002,010,0002,535,424
6Jan 1, 2026 16:163,610139,695,687117,114,0002,001,0002,318,336