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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 01:47Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 01:47010,934,1171,522,0001,522,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 01:47011,331,8791,042,0002,129,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 01:47011,035,5381,045,0002,154,0002,121,728expected "16384 ", got "349 "stderr
4Jan 1, 2026 19:473,516135,119,033114,039,0002,000,0002,416,640
5Jan 1, 2026 19:473,552140,682,611115,224,0002,003,0002,416,640
6Jan 1, 2026 19:473,595142,513,310117,642,000996,0002,420,736