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 1, 2026 23:04zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 01:55Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 01:55017,490,3103,321,0006,318,0002,121,728expected "16384 ", got "786 "stderr
2Jul 5, 2026 01:55017,999,7143,316,0006,846,0002,121,728expected "16384 ", got "786 "stderr
3Jul 5, 2026 01:55017,978,0893,314,0006,541,0002,121,728expected "16384 ", got "786 "stderr
4Jan 1, 2026 23:043,540141,193,247108,833,0007,987,0002,383,872
5Jan 1, 2026 23:043,552141,244,390111,216,0006,011,0002,424,832
6Jan 1, 2026 23:043,608140,700,363113,061,0006,003,0002,437,120