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 17:04zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 07:20Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 07:21010,982,8761,527,0001,527,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 07:21010,860,4161,042,0002,137,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 07:21010,994,5321,046,0002,206,0002,121,728expected "16384 ", got "349 "stderr
4Jan 1, 2026 17:043,654142,743,452118,569,0002,009,0002,420,736
5Jan 1, 2026 17:043,698144,815,589120,036,0002,000,0002,273,280
6Jan 1, 2026 17:043,747154,425,934120,660,0002,991,0002,408,448