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 26, 2025 20:40zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 12:38Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 12:38012,237,4592,131,0002,167,0002,121,728expected "16384 ", got "786 "stderr
2Jul 5, 2026 12:38012,190,8872,127,0002,211,0002,121,728expected "16384 ", got "786 "stderr
3Jul 5, 2026 12:38012,278,5352,130,0002,221,0002,121,728expected "16384 ", got "786 "stderr
4Dec 26, 2025 20:403,999158,899,221119,963,00011,996,0002,351,104
5Dec 26, 2025 20:404,000150,895,941122,014,00010,001,0002,502,656
6Dec 26, 2025 20:404,013158,295,406121,389,00011,035,0002,375,680