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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 09:12Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 09:13021,340,5305,381,0007,968,0002,121,728expected "16384 ", got "786 "stderr
2Jul 5, 2026 09:13021,697,3995,462,0007,890,0002,121,728expected "16384 ", got "786 "stderr
3Jul 5, 2026 09:13020,792,7805,394,0007,473,0002,121,728expected "16384 ", got "786 "stderr
4Dec 30, 2025 17:523,752150,570,421115,839,0007,988,0002,285,568
5Dec 30, 2025 17:523,765147,015,548114,234,00010,020,0002,531,328
6Dec 30, 2025 17:523,784148,770,261114,890,0009,990,0002,297,856