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 9, 2026 14:42Josu San MartinJosu San MartinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 31, 2026 15:57Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 15:57086,732,66972,668,0003,258,0002,113,536expected "2901565 ", got "2901316 "
2Oct 31, 2026 15:57087,035,79572,920,0003,290,0002,113,536expected "2905593 ", got "2905333 "
3Oct 31, 2026 15:5745325,654,45713,913,0001,064,0002,113,536
4Jan 9, 2026 14:426,804249,182,064222,521,0001,995,0002,379,776
5Jan 9, 2026 14:426,811247,806,312219,784,0004,995,0002,375,680
6Jan 9, 2026 14:427,291259,896,952236,600,0003,993,0002,502,656