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 31, 2025 00:42zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 14:52Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 14:52018,096,1063,333,0006,773,0002,121,728expected "16384 ", got "786 "stderr
2Jul 5, 2026 14:52017,357,3204,499,0004,811,0002,121,728expected "16384 ", got "786 "stderr
3Jul 5, 2026 14:52017,207,5063,349,0005,847,0002,121,728expected "16384 ", got "786 "stderr
4Dec 31, 2025 00:424,534171,405,643144,644,0004,987,0002,469,888
5Dec 31, 2025 00:424,618187,270,287147,393,0005,013,0002,469,888
6Dec 31, 2025 00:424,655182,566,655145,631,0007,979,0002,469,888