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 30, 2025 17:45zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 14:15Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 14:16021,341,1855,444,0007,882,0002,121,728expected "16384 ", got "786 "stderr
2Jul 5, 2026 14:16020,633,4995,320,0007,303,0002,121,728expected "16384 ", got "786 "stderr
3Jul 5, 2026 14:16020,970,0385,362,0007,569,0002,121,728expected "16384 ", got "786 "stderr
4Dec 30, 2025 17:454,131166,684,507127,309,0009,021,0002,297,856
5Dec 30, 2025 17:454,150163,232,768127,960,0008,997,0002,289,664
6Dec 30, 2025 17:454,261164,411,077131,650,0008,976,0002,383,872