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 07:27Rajarshi BasuRajarshi BasuError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 19:35Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 19:35016,632,7462,652,0002,652,0002,125,824expected "16384 ", got "445 "stderr
2Jul 4, 2026 19:35015,717,0612,850,0002,851,0002,125,824expected "16384 ", got "445 "stderr
3Jul 4, 2026 19:35015,413,3442,887,0002,887,0002,125,824expected "16384 ", got "445 "stderr
4Jan 3, 2026 07:273,342133,844,050105,275,0005,013,0002,514,944
5Jan 3, 2026 07:273,409141,026,166108,490,0004,018,0002,506,752
6Jan 3, 2026 07:273,420134,445,735108,868,0003,995,0002,338,816