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 25, 2025 23:06zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 10:12Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 10:13011,520,3761,874,0001,873,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 10:13011,674,1122,619,0001,309,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 10:13011,716,4072,658,0001,329,0002,121,728expected "16384 ", got "349 "stderr
4Dec 25, 2025 23:063,819146,340,351117,035,0009,002,0002,392,064
5Dec 25, 2025 23:063,830143,634,257120,367,0006,018,0002,437,120
6Dec 25, 2025 23:063,854151,058,384119,169,0008,011,0002,404,352