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 listJan 1, 2026 23:03zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 14:08Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 14:08015,435,4762,323,0005,157,0002,121,728expected "16384 ", got "786 "stderr
2Jul 5, 2026 14:08015,233,3112,320,0005,110,0002,121,728expected "16384 ", got "786 "stderr
3Jul 5, 2026 14:08015,519,1283,046,0004,688,0002,121,728expected "16384 ", got "786 "stderr
4Jan 1, 2026 23:034,087166,041,422128,879,0005,994,0002,392,064
5Jan 1, 2026 23:034,115155,581,824129,812,0005,991,0002,387,968
6Jan 1, 2026 23:034,147175,252,837130,850,0005,993,0002,392,064