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 21:15zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 15:25Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 15:25010,904,8291,044,0002,174,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 15:25010,881,2301,042,0002,118,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 15:25010,981,1461,539,0001,541,0002,121,728expected "16384 ", got "349 "stderr
4Jan 2, 2026 21:153,184125,521,671103,069,0002,001,0002,273,280
5Jan 2, 2026 21:153,297134,882,223106,792,0001,996,0002,420,736
6Jan 2, 2026 21:153,307132,967,531108,144,0001,001,0002,416,640