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

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 19:56Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 19:57012,862,29603,503,0002,117,632expected "16384 ", got "574 "
2Jul 4, 2026 19:57014,333,00803,214,0002,117,632expected "16384 ", got "574 "
3Jul 4, 2026 19:57013,012,08203,577,0002,117,632expected "16384 ", got "574 "
4Jan 2, 2026 12:053,414137,316,567109,673,0002,991,0002,387,968
5Jan 2, 2026 12:053,420134,235,652110,851,0001,997,0002,387,968
6Jan 2, 2026 12:053,437136,049,568110,396,0003,010,0002,285,568