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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 10:57Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 10:58011,580,2842,545,0001,272,0002,121,728expected "16384 ", got "353 "stderr
2Jul 5, 2026 10:58011,733,3642,648,0001,324,0002,121,728expected "16384 ", got "353 "stderr
3Jul 5, 2026 10:58011,576,8261,870,0001,869,0002,121,728expected "16384 ", got "353 "stderr
4Dec 25, 2025 22:443,812153,966,305114,812,00010,982,0002,363,392
5Dec 25, 2025 22:443,862153,896,730121,441,0006,021,0002,355,200
6Dec 25, 2025 22:443,883147,541,795119,129,0009,009,0002,478,080