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 23:05zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 02:09Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 02:10023,561,3246,074,0009,509,0002,121,728expected "16384 ", got "786 "stderr
2Jul 5, 2026 02:10023,487,6626,091,0009,386,0002,121,728expected "16384 ", got "786 "stderr
3Jul 5, 2026 02:10023,245,9676,117,0009,291,0002,121,728expected "16384 ", got "786 "stderr
4Jan 1, 2026 23:053,545141,657,421107,994,0008,999,0002,347,008
5Jan 1, 2026 23:053,557140,431,382107,352,00010,032,0002,433,024
6Jan 1, 2026 23:053,654147,838,992109,608,00010,960,0002,502,656