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 4, 2026 04:24zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 09:03Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 09:04010,950,3671,047,0002,160,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 09:04010,876,2751,039,0002,098,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 09:04010,913,2961,039,0002,164,0002,121,728expected "16384 ", got "349 "stderr
4Jan 4, 2026 04:243,157125,428,255103,187,0001,001,0002,535,424
5Jan 4, 2026 04:243,181129,715,946102,963,0001,999,0002,269,184
6Jan 4, 2026 04:243,346135,793,436108,400,0002,007,0002,424,832