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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 12:23Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 12:23012,293,6532,200,0002,287,0002,121,728expected "16384 ", got "785 "stderr
2Jul 5, 2026 12:23012,333,3502,202,0002,405,0002,121,728expected "16384 ", got "785 "stderr
3Jul 5, 2026 12:23012,807,5272,200,0002,388,0002,121,728expected "16384 ", got "785 "stderr
4Dec 26, 2025 20:423,960155,993,210125,687,0004,987,0002,519,040
5Dec 26, 2025 20:423,973152,962,635118,094,00013,010,0002,260,992
6Dec 26, 2025 20:423,983154,647,069123,416,0008,027,0002,396,160