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 8, 2026 19:41Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 15, 2026 20:45Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 20:53048,741,10235,119,0003,133,0002,113,536expected "323338 ", got "323032 "
2Oct 15, 2026 20:53029,462,05515,808,0003,211,0002,113,536expected "11758 ", got "11756 "
3Oct 15, 2026 20:53082,863,04669,135,0003,220,0002,113,536expected "2104699 ", got "2074975 "
4Jan 8, 2026 19:419,312333,764,398303,278,0004,003,0002,502,656
5Jan 8, 2026 19:419,407338,735,848306,451,0003,992,0002,330,624
6Jan 8, 2026 19:419,536344,094,653312,679,0001,997,0002,301,952