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

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 23:39Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 23:40011,042,5881,546,0001,546,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 23:40010,901,3111,044,0002,138,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 23:40011,214,1711,051,0002,193,0002,121,728expected "16384 ", got "349 "stderr
4Jan 2, 2026 19:583,453134,914,261111,941,0001,998,0002,535,424
5Jan 2, 2026 19:583,512141,244,923114,895,000999,0002,535,424
6Jan 2, 2026 19:583,535140,028,830116,654,00002,273,280