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:01zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 08:20Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 08:20019,606,1554,242,0007,571,0002,121,728expected "16384 ", got "786 "stderr
2Jul 5, 2026 08:20019,584,9684,251,0007,387,0002,121,728expected "16384 ", got "786 "stderr
3Jul 5, 2026 08:20019,670,7124,244,0007,473,0002,121,728expected "16384 ", got "786 "stderr
4Jan 1, 2026 23:013,732151,580,097114,156,0009,012,0002,437,120
5Jan 1, 2026 23:013,734147,501,262117,222,0006,011,0002,465,792
6Jan 1, 2026 23:013,738144,666,850119,328,0004,011,0002,347,008