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 3, 2026 05:32Rajarshi BasuRajarshi BasuError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 18:36Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 18:36013,613,2811,360,0002,699,0002,125,824expected "16384 ", got "445 "stderr
2Jul 4, 2026 18:36014,962,7811,168,0002,478,0002,125,824expected "16384 ", got "445 "stderr
3Jul 4, 2026 18:36013,808,6411,426,0002,912,0002,125,824expected "16384 ", got "445 "stderr
4Jan 3, 2026 05:323,295139,048,396105,745,0002,992,0002,297,856
5Jan 3, 2026 05:323,383136,619,048106,663,0004,984,0002,293,760
6Jan 3, 2026 05:323,644141,449,960116,253,0004,008,0002,297,856