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 2, 2026 12:25Rajarshi BasuRajarshi BasuError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 18:21Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 18:21014,269,99503,215,0002,117,632expected "16384 ", got "445 "
2Jul 4, 2026 18:21014,244,33303,596,0002,117,632expected "16384 ", got "445 "
3Jul 4, 2026 18:21012,940,27103,468,0002,117,632expected "16384 ", got "445 "
4Jan 2, 2026 12:253,373141,348,639109,302,0002,005,0002,285,568
5Jan 2, 2026 12:253,375135,023,528109,372,0002,006,0002,392,064
6Jan 2, 2026 12:253,759151,274,680122,036,0002,000,0002,285,568