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

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 08:19Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 08:19011,060,6961,050,0002,107,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 08:19010,930,5351,501,0001,501,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 08:19010,927,8901,036,0002,147,0002,121,728expected "16384 ", got "349 "stderr
4Jan 4, 2026 17:153,117131,034,443101,870,000998,0002,535,424
5Jan 4, 2026 17:153,168136,334,197104,551,00002,412,544
6Jan 4, 2026 17:153,196126,525,913104,480,0001,004,0002,412,544