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 9, 2026 02:59zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 14:50Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 14:51010,981,3271,527,0001,527,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 14:51010,990,2771,518,0001,518,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 14:51010,864,1551,044,0002,126,0002,121,728expected "16384 ", got "349 "stderr
4Jan 9, 2026 02:593,258134,788,255106,512,0001,004,0002,535,424
5Jan 9, 2026 02:593,288129,024,122107,494,0001,004,0002,416,640
6Jan 9, 2026 02:593,428139,817,616112,120,0001,001,0002,334,720