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 20:37zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 03:46Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 03:46010,925,1741,046,0002,185,0002,121,728expected "16384 ", got "32 "stderr
2Jul 5, 2026 03:46010,934,1291,510,0001,510,0002,121,728expected "16384 ", got "32 "stderr
3Jul 5, 2026 03:46010,965,3851,043,0002,241,0002,121,728expected "16384 ", got "32 "stderr
4Jan 1, 2026 20:373,450139,260,018112,858,000998,0002,412,544
5Jan 1, 2026 20:373,606146,046,269116,987,0001,999,0002,273,280
6Jan 1, 2026 20:373,627144,498,957118,682,000997,0002,420,736