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 00:05zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 03:38Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 03:38010,804,1481,055,0002,102,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 03:38010,795,0301,050,0002,049,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 03:38011,234,9211,053,0002,054,0002,121,728expected "16384 ", got "349 "stderr
4Jan 2, 2026 00:053,578141,885,345115,076,0003,002,0002,273,280
5Jan 2, 2026 00:053,595142,716,571116,643,0001,993,0002,416,640
6Jan 2, 2026 00:053,657146,970,760119,675,000997,0002,318,336