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 7, 2026 03:53zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 16:09Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 16:09010,947,5901,042,0002,146,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 16:09010,874,9131,041,0002,093,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 16:09010,947,3921,040,0002,214,0002,121,728expected "16384 ", got "349 "stderr
4Jan 7, 2026 03:533,184133,479,492102,060,0003,001,0002,535,424
5Jan 7, 2026 03:533,305130,662,779107,058,0002,001,0002,404,352
6Jan 7, 2026 03:533,311127,157,150107,269,0002,005,0002,400,256