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 22:35Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 31, 2026 16:22Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 16:330164,657,322151,620,0002,178,0002,117,632expected "2901352 ", got "2533855 "
2Oct 31, 2026 16:330162,935,375149,943,0002,164,0002,117,632expected "2904731 ", got "2537232 "
3Oct 31, 2026 16:330163,287,193150,309,0002,169,0002,117,632expected "2906725 ", got "2543578 "
4Jan 7, 2026 22:3513,555472,766,709443,322,0004,002,0002,289,664
5Jan 7, 2026 22:3513,900482,487,626456,703,0001,998,0002,445,312
6Jan 7, 2026 22:3514,005487,753,745459,167,0003,001,0002,342,912