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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 04:23Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 04:23011,020,8241,521,0001,523,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 04:23010,907,1641,043,0002,186,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 04:23010,990,1091,525,0001,527,0002,121,728expected "16384 ", got "349 "stderr
4Jan 1, 2026 17:163,522143,971,042115,211,0001,001,0002,273,280
5Jan 1, 2026 17:163,627145,975,296117,702,0001,994,0002,424,832
6Jan 1, 2026 17:163,635139,751,501116,970,0002,999,0002,506,752