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 09:00zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 09:04Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 09:05011,016,8621,039,0002,220,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 09:05010,963,5821,516,0001,517,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 09:05010,858,8961,046,0002,159,0002,121,728expected "16384 ", got "349 "stderr
4Jan 2, 2026 09:003,748149,177,477121,679,0001,994,0002,535,424
5Jan 2, 2026 09:003,763148,848,006123,171,0001,001,0002,535,424
6Jan 2, 2026 09:003,771148,376,240122,434,0002,007,0002,273,280