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 04:23Rajarshi BasuRajarshi BasuError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 17:52Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 17:52014,977,9271,189,0002,509,0002,125,824expected "16384 ", got "445 "stderr
2Jul 4, 2026 17:52015,120,8201,367,0002,744,0002,125,824expected "16384 ", got "445 "stderr
3Jul 4, 2026 17:52013,647,4111,343,0002,755,0002,125,824expected "16384 ", got "445 "stderr
4Jan 3, 2026 04:233,333133,517,325105,978,0003,999,0002,293,760
5Jan 3, 2026 04:233,358133,152,795106,811,0003,992,0002,285,568
6Jan 3, 2026 04:233,360132,474,032106,880,0003,995,0002,510,848