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 17:42zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 01:24Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 01:25010,994,0801,043,0002,125,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 01:25010,855,5121,046,0002,115,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 01:25011,079,7251,035,0002,109,0002,121,728expected "16384 ", got "349 "stderr
4Jan 1, 2026 17:423,400132,977,733110,181,0002,003,0002,420,736
5Jan 1, 2026 17:423,545137,379,866114,973,0001,999,0002,502,656
6Jan 1, 2026 17:423,763144,949,706122,184,0002,003,0002,420,736