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 9, 2026 02:54zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 08:26Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 08:26010,844,9511,040,0002,115,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 08:26010,838,5911,042,0002,112,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 08:26010,908,0271,043,0002,230,0002,121,728expected "16384 ", got "349 "stderr
4Jan 9, 2026 02:543,131126,808,928100,315,0003,009,0002,535,424
5Jan 9, 2026 02:543,168130,704,738104,532,00002,510,848
6Jan 9, 2026 02:543,175132,219,684102,782,0001,995,0002,412,544