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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 02:46Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 02:47010,980,7451,045,0002,138,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 02:47010,956,3471,041,0002,170,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 02:47010,986,8941,533,0001,533,0002,121,728expected "16384 ", got "349 "stderr
4Jan 1, 2026 19:193,490141,325,984113,159,0002,002,0002,273,280
5Jan 1, 2026 19:193,579141,712,707116,093,0002,001,0002,416,640
6Jan 1, 2026 19:193,833155,285,955125,496,0001,003,0002,420,736