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 19:55zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 07:28Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 07:28011,341,0011,048,0002,165,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 07:28010,879,4101,041,0002,158,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 07:28011,049,7261,043,0002,206,0002,121,728expected "16384 ", got "349 "stderr
4Jan 1, 2026 19:553,587141,451,085116,374,0002,006,0002,408,448
5Jan 1, 2026 19:553,702149,479,613121,171,0001,001,0002,424,832
6Jan 1, 2026 19:553,748152,436,522121,679,0001,994,0002,273,280