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 07:23Rajarshi BasuRajarshi BasuError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 17:30Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 17:30011,985,62902,312,0002,125,824expected "16384 ", got "445 "stderr
2Jul 4, 2026 17:30013,091,01702,349,0002,125,824expected "16384 ", got "445 "stderr
3Jul 4, 2026 17:30012,251,35002,572,0002,125,824expected "16384 ", got "445 "stderr
4Jan 3, 2026 07:233,327131,628,162104,815,0004,991,0002,306,048
5Jan 3, 2026 07:233,338133,254,983105,158,0005,007,0002,514,944
6Jan 3, 2026 07:233,398140,151,270108,119,0004,004,0002,514,944