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 3, 2026 10:19zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 15:18Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 15:18011,052,1721,034,0002,070,0002,121,728expected "16384 ", got "348 "stderr
2Jul 4, 2026 15:18010,957,1301,521,0001,522,0002,121,728expected "16384 ", got "348 "stderr
3Jul 4, 2026 15:18010,981,9311,534,0001,534,0002,121,728expected "16384 ", got "348 "stderr
4Jan 3, 2026 10:193,266134,851,945105,787,0001,995,0002,416,640
5Jan 3, 2026 10:193,296135,916,226106,761,0001,995,0002,416,640
6Jan 3, 2026 10:193,328137,466,491107,828,0001,996,0002,424,832