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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 08:42Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 08:42028,753,8628,565,00012,309,0002,121,728expected "16384 ", got "786 "stderr
2Jul 5, 2026 08:42029,158,2708,596,00012,549,0002,121,728expected "16384 ", got "786 "stderr
3Jul 5, 2026 08:42029,666,5968,574,00013,083,0002,121,728expected "16384 ", got "786 "stderr
4Dec 30, 2025 22:283,754145,816,602108,886,00014,984,0002,523,136
5Dec 30, 2025 22:283,755150,619,878108,921,00014,989,0002,379,776
6Dec 30, 2025 22:283,808150,755,248111,703,00013,962,0002,531,328