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 listDec 24, 2025 12:00zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 13:53Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 13:53011,391,2851,645,0001,645,0002,121,728expected "16384 ", got "32 "stderr
2Jul 5, 2026 13:53010,940,3291,580,0001,579,0002,121,728expected "16384 ", got "32 "stderr
3Jul 5, 2026 13:53010,940,2201,565,0001,565,0002,121,728expected "16384 ", got "32 "stderr
4Dec 24, 2025 12:004,038160,563,144125,243,0008,015,0002,367,488
5Dec 24, 2025 12:004,083155,583,575123,762,00010,978,0002,457,600
6Dec 24, 2025 12:004,324165,885,102133,711,0008,980,0002,338,816