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 7, 2026 03:23zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 10:07Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 10:07011,058,0001,035,0002,284,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 10:07010,957,0671,042,0002,141,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 10:07011,212,1911,043,0002,105,0002,121,728expected "16384 ", got "349 "stderr
4Jan 7, 2026 03:233,158126,121,762102,224,0002,004,0002,535,424
5Jan 7, 2026 03:233,199130,541,789104,573,0001,005,0002,396,160
6Jan 7, 2026 03:233,241131,695,906105,970,000999,0002,400,256