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 1, 2026 16:04zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 04:45Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 04:4509,700,90001,918,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 04:4509,770,50302,050,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 04:4509,731,47502,073,0002,121,728expected "16384 ", got "349 "stderr
4Jan 1, 2026 16:043,611140,590,885116,171,0003,004,0002,334,720
5Jan 1, 2026 16:043,636137,399,177117,981,0001,999,0002,326,528
6Jan 1, 2026 16:043,667149,671,340119,027,0002,000,0002,486,272