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 10, 2026 20:03zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 14:51Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 14:51010,978,2221,043,0002,173,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 14:51011,052,7131,031,0002,093,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 14:51011,347,1231,039,0002,097,0002,121,728expected "16384 ", got "349 "stderr
4Jan 10, 2026 20:033,178125,319,116103,872,000998,0002,416,640
5Jan 10, 2026 20:033,289135,340,985107,532,0001,004,0002,412,544
6Jan 10, 2026 20:033,326133,411,834108,763,000997,0002,535,424