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 listDec 29, 2025 18:19zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 07:57Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 07:58021,001,1395,318,0007,692,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 07:58021,491,8055,402,0008,143,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 07:58020,912,1045,182,0007,689,0002,121,728expected "16384 ", got "349 "stderr
4Dec 29, 2025 18:193,692141,709,205114,858,0006,991,0002,301,952
5Dec 29, 2025 18:193,718147,091,554112,722,0009,975,0002,371,584
6Dec 29, 2025 18:193,730154,231,861115,085,0008,005,0002,281,472