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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 10:50Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 10:50011,672,4902,608,0001,303,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 10:50011,722,8662,658,0001,329,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 10:50011,757,6522,621,0001,310,0002,121,728expected "16384 ", got "349 "stderr
4Dec 26, 2025 15:133,848148,787,153119,973,0006,998,0002,400,256
5Dec 26, 2025 15:133,861154,041,775120,397,0007,023,0002,383,872
6Dec 26, 2025 15:133,870147,076,291116,734,00010,975,0002,396,160