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 22:47zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 23:01Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 23:01019,575,9114,262,0007,462,0002,121,728expected "16384 ", got "786 "stderr
2Jul 4, 2026 23:01019,866,5304,262,0007,762,0002,121,728expected "16384 ", got "786 "stderr
3Jul 4, 2026 23:01019,537,3334,238,0007,353,0002,121,728expected "16384 ", got "786 "stderr
4Jan 1, 2026 22:473,500144,590,891107,480,0008,035,0002,396,160
5Jan 1, 2026 22:473,505139,530,992106,704,0008,975,0002,490,368
6Jan 1, 2026 22:473,529144,998,985108,422,0008,031,0002,367,488