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 11, 2026 01:27zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 05:43Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 05:44010,963,4951,042,0002,130,0002,121,728expected "16384 ", got "353 "stderr
2Jul 4, 2026 05:44010,929,3561,031,0002,084,0002,121,728expected "16384 ", got "353 "stderr
3Jul 4, 2026 05:44010,897,3431,043,0002,134,0002,121,728expected "16384 ", got "353 "stderr
4Jan 11, 2026 01:273,047129,965,76199,557,0001,005,0002,408,448
5Jan 11, 2026 01:273,129133,538,669100,239,0003,007,0002,293,760
6Jan 11, 2026 01:273,146128,356,322101,817,0001,996,0002,416,640