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 29, 2025 19:59zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 11:43Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 11:45020,226,0855,300,0007,045,0002,121,728expected "16384 ", got "789 "stderr
2Jul 5, 2026 11:45032,499,7325,423,0007,599,0002,121,728expected "16384 ", got "789 "stderr
3Jul 5, 2026 11:45020,756,9245,421,0007,514,0002,121,728expected "16384 ", got "789 "stderr
4Dec 29, 2025 19:593,893159,509,044121,437,0007,025,0002,510,848
5Dec 29, 2025 19:593,935153,952,661120,861,0008,989,0002,289,664
6Dec 29, 2025 19:593,943151,070,212121,120,0009,008,0002,363,392