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 2, 2026 20:16zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 00:10Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 00:10011,216,4871,043,0002,130,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 00:10010,911,2071,524,0001,526,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 00:10010,939,7981,542,0001,542,0002,121,728expected "16384 ", got "349 "stderr
4Jan 2, 2026 20:163,412136,740,916111,607,0001,005,0002,412,544
5Jan 2, 2026 20:163,518134,711,114114,096,0002,001,0002,273,280
6Jan 2, 2026 20:163,545143,295,253114,987,0001,999,0002,273,280