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 listDec 31, 2025 00:45zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 07:35Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 07:35024,387,0726,629,0009,671,0002,121,728expected "16384 ", got "786 "stderr
2Jul 5, 2026 07:35023,783,4846,304,0009,458,0002,121,728expected "16384 ", got "786 "stderr
3Jul 5, 2026 07:35024,546,1776,260,00010,386,0002,121,728expected "16384 ", got "786 "stderr
4Dec 31, 2025 00:453,681150,402,423112,437,0009,035,0002,371,584
5Dec 31, 2025 00:453,705145,621,896111,256,00011,025,0002,437,120
6Dec 31, 2025 00:453,706141,348,798114,292,0008,020,0002,428,928