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 4, 2026 21:35zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 10:27Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 10:28011,293,4931,046,0002,158,0002,121,728expected "16384 ", got "770 "stderr
2Jul 5, 2026 10:28010,993,4721,035,0002,087,0002,121,728expected "16384 ", got "770 "stderr
3Jul 5, 2026 10:28011,295,9631,046,0002,241,0002,121,728expected "16384 ", got "770 "stderr
4Jan 4, 2026 21:353,784147,650,546121,875,0002,996,0002,535,424
5Jan 4, 2026 21:353,834150,600,343125,510,0001,004,0002,535,424
6Jan 4, 2026 21:353,883153,161,173127,146,0001,001,0002,416,640