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 05:34Rajarshi BasuRajarshi BasuError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 14:17Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 14:17015,133,7741,163,0002,614,0002,125,824expected "16384 ", got "445 "stderr
2Jul 5, 2026 14:17013,675,1541,378,0002,720,0002,125,824expected "16384 ", got "445 "stderr
3Jul 5, 2026 14:17013,717,0571,432,0002,747,0002,125,824expected "16384 ", got "445 "stderr
4Jan 3, 2026 05:344,188163,586,641135,202,0003,004,0002,523,136
5Jan 3, 2026 05:344,196165,985,104134,454,0004,013,0002,514,944
6Jan 3, 2026 05:344,212165,848,600134,989,0003,999,0002,514,944