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 10, 2026 02:15zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 06:35Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 06:36010,878,6241,040,0002,239,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 06:36010,859,0971,040,0002,112,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 06:36010,879,7211,040,0002,092,0002,121,728expected "16384 ", got "349 "stderr
4Jan 10, 2026 02:153,106125,084,407100,500,0002,010,0002,420,736
5Jan 10, 2026 02:153,150125,435,669100,946,0002,998,0002,404,352
6Jan 10, 2026 02:153,159124,289,194101,245,0003,007,0002,416,640