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

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 16:23Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 16:24010,768,0171,507,0001,507,0002,121,728expected "16384 ", got "350 "stderr
2Jul 4, 2026 16:24011,043,0971,051,0002,104,0002,121,728expected "16384 ", got "350 "stderr
3Jul 4, 2026 16:24010,999,9241,035,0002,072,0002,121,728expected "16384 ", got "350 "stderr
4Jan 2, 2026 20:393,306130,003,757107,085,0002,001,0002,424,832
5Jan 2, 2026 20:393,315131,149,879107,403,0002,007,0002,510,848
6Jan 2, 2026 20:393,397136,117,147111,116,0001,001,0002,416,640