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 9, 2026 02:50zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 04:58Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 04:59010,852,9231,041,0002,144,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 04:59011,007,5771,043,0002,104,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 04:59010,774,3221,037,0002,099,0002,121,728expected "16384 ", got "349 "stderr
4Jan 9, 2026 02:503,107131,274,889101,538,0001,005,0002,416,640
5Jan 9, 2026 02:503,120127,586,116100,954,0001,999,0002,416,640
6Jan 9, 2026 02:503,126126,307,474101,143,0002,002,0002,416,640